Domination in Graphs: Core Concepts

DOI10.1007/978-3-031-09496-5OpenAlexW4367459369MaRDI QIDQ5094374

No author found.

Publication date: 2 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09496-5

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items (16)

Domination and dominator colorings in planar graphs with small diameter ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Graphs with unique minimum specified domination sets ⋮ Partial domination in supercubic graphs ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Paired-domination game played on cycles ⋮ Roman domination and independent Roman domination on graphs with maximum degree three ⋮ A characterization of well-dominated Cartesian products ⋮ Super domination: graph classes, products and enumeration ⋮ Complexity of total dominator coloring in graphs ⋮ Common domination perfect graphs ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ Packings in bipartite prisms and hypercubes ⋮ Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Further results on 2-distance coloring of graphs

This page was built for publication: Domination in Graphs: Core Concepts