Abstract
AbstractWe say that a signed graph is ‐critical if it is not ‐colorable but every one of its proper subgraphs is ‐colorable. Using the definition of colorability due to Naserasr, Wang, and Zhu that extends the notion of circular colorability, we prove that every 3‐critical signed graph on vertices has at least edges, and that this bound is asymptotically tight. It follows that every signed planar or projective‐planar graph of girth at least 6 is (circular) 3‐colorable, and for the projective‐planar case, this girth condition is best possible. To prove our main result, we reformulate it in terms of the existence of a homomorphism to the signed graph , which is the positive triangle augmented with a negative loop on each vertex.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.