Abstract
We prove that for n ≥ 4, a fiber product of n-chromatic graphs over n-colourings can have chromatic number strictly less than n. This refutes a conjecture of A. Khelladi, Sur une opération binaire de graphes, Communication to the 32d Week of Science, Damas (Syria, 7-13 November 1992).
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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
