Abstract
Abstract For graphs G and H, let G ⊕ H denote their Cartesian sum. We prove that for any graphs G and H, χ ( G ⊕ H ) ⩽ max { ⌈ χ c ( G ) χ ( H ) ⌉ , ⌈ χ ( G ) χ c ( H ) ⌉ } . Moreover the bound is sharp. We conjecture that for any graphs G and H, χ c ( G ⊕ H ) ⩽ max { χ ( H ) χ c ( G ) , χ ( G ) χ c ( H ) } . The conjectured bound would be sharp if it is true. We confirm this conjecture for graphs G and H with special values of χ c ( G ) and χ c ( H ) . These results improve previously known bounds on the chromatic number and the circular chromatic number for the Cartesian sum of graphs.
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.
