Abstract
AbstractA diamond is a graph on vertices with exactly one pair of nonadjacent vertices, and an odd hole is an induced cycle of odd length greater than 3. If G and H are graphs, G is H‐free if no induced subgraph of G is isomorphic to H. A clique‐coloring of G is an assignment of colors to the vertices of G such that no inclusion‐wise maximal clique of size at least 2 is monochromatic. We show that every (diamond, odd‐hole)‐free graph is 3‐clique‐colorable, answering a question of Bacsó et al. (SIAM J Discrete Math 17(3) (2004), 361–376).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
