Every planar map is four colorable. II: Reducibility
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Nowhere-zero 4-flow in almost Petersen-minor free graphs
- Linear connectivity forces large complete bipartite minors
- Note on coloring graphs without odd-\(K_k\)-minors
- List-coloring graphs without \(K_{4,k}\)-minors
- Cliques, minors and apex graphs
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Efficient bounds for the stable set, vertex cover and set packing problems
- Heawood's empire problem
- The four color proof suffices
- Heawood inequalities
- Map coloring and the vector cross product
- How robust is the n-cube?
- Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
- On the Penrose number of cubic diagrams
- List homomorphisms to reflexive graphs
- The book thickness of a graph
- Hadwiger's conjecture for graphs on the Klein bottle
- On Tutte's extension of the four-colour problem
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Heuristic for rapidly four-coloring large planar graphs
- Modernizing the philosophy of mathematics
- Colouring problems
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Realizing the chromatic numbers of triangulations of surfaces
- Lower bounds for constant degree independent sets
- A note on the minimum cut cover of graphs
- Simultaneously colouring the edges and faces of plane graphs
- The four-colour theorem
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Iterated colorings of graphs.
- Illuminating labyrinths.
- Illuminating disjoint line segments in the plane
- Fractional colouring and Hadwiger's conjecture
- A manifesto for the computational method
- Circular backbone colorings: on matching and tree backbones of planar graphs
- Oriented incidence colourings of digraphs
- Hadwiger's conjecture for squares of 2-trees
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Facial \(L(2, 1)\)-edge-labelings of trees
- On the precise value of the strong chromatic index of a planar graph with a large girth
- 3-coloring triangle-free planar graphs with a precolored 9-cycle
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
- On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
- Formally proving size optimality of sorting networks
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Generating even triangulations on the torus
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Every plane graph is facially-non-repetitively \(C\)-choosable
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Pushing the frontier of minimality
- Differential algebra of cubic planar graphs
- Topological invariants, multivalued maps and computer assisted proofs in dynamics
- Three moves on signed surface triangulations
- Computers and discovery in algebraic graph theory
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
- A categorical setting for the 4-colour theorem
- A blow-up construction and graph coloring
- Ugly mathematics: why do mathematicians dislike computer-assisted proofs?
- Additive number theory via automata theory
- Coloring squares of graphs with mad constraints
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- Coloring drawings of graphs
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
- Towards the small quasi-kernel conjecture
- Immersion and clustered coloring
- Tutte paths and long cycles in circuit graphs
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- Further extensions of the Grötzsch theorem
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
- A heuristic for the coloring of planar graphs
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
- Some remarks on even-hole-free graphs
- Graph coloring and semidefinite rank
- Colouring planar graphs with bounded monochromatic components
- The 2-factor polynomial detects even perfect matchings
- Partitioning sparse graphs into an independent set and a graph with bounded size components
- Decomposition and r-hued coloring of K₄(7)-minor free graphs
- Computer-assisted estimates for Birkhoff normal forms
- Monochromatic subgraphs in iterated triangulations
- On the cyclic coloring conjecture
- Foam evaluation and Kronheimer-Mrowka theories
- A survey on the cyclic coloring and its relaxations
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- Ramsey-goodness -- and otherwise
- Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs
- Near-colorings: non-colorable graphs and NP-completeness
- The complexity of the Hajós calculus for planar graphs
- The surveyability of long proofs
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- On the vertex partition of planar graphs into forests with bounded degree
- Facial rainbow coloring of plane graphs
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- Kempe-locking configurations
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
This page was built for publication: Every planar map is four colorable. II: Reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250224)
