
TL;DR
This paper investigates specific configurations in 4-chromatic maximal planar graphs, demonstrating their reducibility by analyzing 4-base-modules and their colorings, thus contributing to graph coloring theory.
Contribution
It introduces the concept of 4-base-modules and proves the reducibility of 55- and 56-configurations through decycle coloring techniques.
Findings
Every 4-base-module contains a 4-coloring with bichromatic cycles.
Existence of decycle colorings where module-paths have differently colored endpoints.
Reduction of configuration problems to decycle coloring in 4-base-modules.
Abstract
Let be a 4-chromatic maximal planar graph (MPG) with the minimum degree of at least 4 and let be an even-length cycle of .If for every in some Kempe equivalence class of , then we call an unchanged bichromatic cycle (UBC) of , and correspondingly an unchanged bichromatic cycle maximal planar graph (UBCMPG) with respect to , where . For an UBCMPG with respect to an UBC , the subgraph of induced by the set of edges belonging to and its interior (or exterior), denoted by , is called a base-module of ; in particular, when the length of is equal to four, we use instead of and call a 4-base-module. In this paper, we first study the properties of UBCMPGs and show that every 4-base-module contains a 4-coloring under which is bichromatic and there are at least two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems
