Abstract
AbstractAs a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no ‐subdivision are 4‐colorable. Any possible counterexample to this conjecture with minimum number of vertices is called a Hajós graph. Previous results show that Hajós graphs are 4‐connected but not 5‐connected. A ‐separation in a graph is a pair of edge‐disjoint subgraphs of such that , , and for . In this paper, we show that Hajós graphs do not admit a 4‐separation such that and can be drawn in the plane with no edge crossings and all vertices in incident with a common face. This is a step in our attempt to reduce Hajós' conjecture to the Four Color Theorem.
Sign-in/Register to access full text options 
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.
