Name
Abstract | ||
|---|---|---|
For a plane near-triangulation G with the outer face bounded by a cycle C, let n(G)* denote the function that to each 4-coloring psi of C assigns the number of ways psi extends to a 4-coloring ofG. The Block-count reducibility argument (which has been developed in connection with attempted proofs of the Four Color Theorem) is equivalent to the statement that the function n(G)* belongs to a certain cone in the space of all functions from 4-colorings of C to real numbers. We investigate the properties of this cone for vertical bar C vertical bar = 5, formulate a conjecture strengthening the Four Color Theorem, and present evidence supporting this conjecture. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1002/jgt.22767 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
coloring count cone, four color theorem, graph coloring, planar graphs | Journal | 100 |
Issue | ISSN | Citations |
1 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dvořák Zdeněk | 1 | 1 | 2.40 |
| Bernard Lidický | 2 | 9 | 5.00 |