Affiliation:
1. Université Clermont Auvergne Clermont‐Ferrand France
2. University of Waterloo Waterloo Ontario Canada
3. Simon Fraser University Burnaby Canada
4. Indian Institute of Technology Dharwad India
5. School of Mathematical Sciences and LPMC Nankai University Tianjin China
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.
Funder
National Natural Science Foundation of China
Agence Nationale de la Recherche
Natural Sciences and Engineering Research Council of Canada
Indo-French Centre for Applied Mathematics
Reference23 articles.
1. Circular Flows in Planar Graphs
2. Density of 5/2-critical graphs
3. Ein Dreifarbensatz fü r dreikreisfreie Netze auf der Kugel;Grötzsch H.;Wiss. Z. Martin‐Luther‐Univ. Halle‐Wittenberg Math.‐Natur. Reihe,1959
4. Counterexamples to Jaeger's Circular Flow Conjecture
5. ON CIRCULAR FLOWS IN GRAPHS