On defining numbers of circular complete graphs

DOI10.1016/J.DISC.2006.07.002MaRDI QIDQ864158zbMATH OpenOpenAlexFDO

Authors Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah

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)

Recommendations

• On the set of circular total chromatic numbers of graphs
• Circular total chromatic numbers of graphs
• On the chromatic number of circulant graphs
• On the number of complete subgraphs and circuits contained in graphs
• On circular-perfect graphs: a survey
• scientific article; zbMATH DE number 1782859
• scientific article; zbMATH DE number 2085001
• Some results on circular perfect graphs and perfect graphs
• A note on the Hadwiger number of circular arc graphs

Cites work

• scientific article; zbMATH DE number 1996250 (Why is no real title available?)
• scientific article; zbMATH DE number 2028653 (Why is no real title available?)
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• A note on the star chromatic number
• Circular chromatic number: A survey
• Circular colouring and algebraic no-homomorphism theorems
• Circular colouring and graph homomorphism
• On the size of the minimum critical set of a Latin square
• Star chromatic number

Cited in

(1)

• Properties of an approximability-related parameter on circular complete graphs

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

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