From domination to coloring. Stephen Hedetniemi's graph theory and beyond

DOI10.1007/978-3-030-31110-0MaRDI QIDQ5236471zbMATH OpenOpenAlexWikidataFDO

Authors Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang

Publication date 8 October 2019

Published in SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-31110-0

zbMATH Keywords

graph coloringdistance in graphsdomination in graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Festschriften (00B30) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 1095171
• Independent domination and graph colorings
• Theory of domination in graphs
• scientific article; zbMATH DE number 843316
• scientific article; zbMATH DE number 1052841

Cited in

(5)

• Complexity issues concerning the quadruple Roman domination problem in graphs
• A textbook of graph theory
• Domination of the rectangular queen's graph
• On domination in signed graphs
• Coloring of non-zero component graphs

This page was built for publication: From domination to coloring. Stephen Hedetniemi's graph theory and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236471)