Domination and dominator colorings in planar graphs with small diameter
From MaRDI portal
Publication:833001
DOI10.1016/J.DAM.2022.02.003zbMath1485.05134OpenAlexW4220739908MaRDI QIDQ833001
Wayne Goddard, Michael A. Henning
Publication date: 28 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.003
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large planar graphs with given diameter and maximum degree
- An algorithm for the dominator chromatic number of a tree
- Total dominator colorings and total domination in graphs
- On the dominator colorings in trees
- Dominator and Total Dominator Colorings in Graphs
- Domination in planar graphs with small diameter*
- Domination numbers of planar graphs
- Total Domination in Graphs
- Domination in Graphs: Core Concepts
- Total dominator chromatic number of a graph
This page was built for publication: Domination and dominator colorings in planar graphs with small diameter