On defining numbers of circular complete graphs

DOI10.1016/j.disc.2006.07.002zbMath1111.05033OpenAlexW2155447044MaRDI QIDQ864158

Nasrin Soltankhah, Amir Daneshgar, Hossein Hajiabolhassan

Publication date: 13 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.002

zbMATH Keywords

graph coloringdefining setcircular coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• On the size of the minimum critical set of a Latin square
• Circular colouring and algebraic no-homomorphism theorems
• A note on the star chromatic number
• Star chromatic number
• Circular colouring and graph homomorphism
• Circular chromatic number: A survey

This page was built for publication: On defining numbers of circular complete graphs