Graph coloring applications and defining sets in graph theory

MaRDI QIDQ4601036zbMATH OpenFDO

Authors Masoumeh Ahadi Moghaddam

Publication date 18 January 2018

Full work available at URL http://d-nb.info/1127044435/34, http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-46127

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) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Defining sets and uniqueness in graph colorings: A survey
• The defining numbers for vertex colorings of certain graphs
• On the computational complexity of defining sets
• scientific article; zbMATH DE number 863472
• On the defining number for vertex colorings of a family of graphs

Cited in

(5)

• Defining sets and uniqueness in graph colorings: A survey
• On the computational complexity of defining sets
• On the extending ofk-regular graphs and their strong defining spectrum
• Defining sets in vertex colorings of graphs and latin rectangles
• Coloration de graphes : fondements et applications

This page was built for publication: Graph coloring applications and defining sets in graph theory

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