Every planar map is four colorable

Cites work

scientific article; zbMATH DE number 3298600 (Why is no real title available?)
scientific article; zbMATH DE number 3399266 (Why is no real title available?)
A systematic approach to the determination of reducible configurations in the four-color conjecture
The existence of unavoidable sets of geographically good configurations

Cited in

(only showing first 100 items - show all)

Simultaneous coloring of edges and faces of plane graphs
On the vertex-arboricity of planar graphs
Bicircular matroids are 3-colorable
Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
Computer-aided proof of Erdős discrepancy properties
Steinberg-like theorems for backbone colouring
Dominated colorings of graphs
On local transformation of polygons with visibility properties.
Extending precolorings of subgraphs of locally planar graphs
Facial entire colouring of plane graphs
Facial achromatic number of triangulations on the sphere
Graph theory (algorithmic, algebraic, and metric problems)
Asymptotic dimension of planes and planar graphs
An algebraic approach to the planar coloring problem
Adjacent vertex distinguishing total colorings of outerplanar graphs
The thickness and chromatic number of \(r\)-inflated graphs
A bound on the chromatic number of the square of a planar graph
deBruijn-like sequences and the irregular chromatic number of paths and cycles
Conjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs)
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
Facial parity edge colouring of plane pseudographs
Unique-maximum edge-colouring of plane graphs with respect to faces
Antisymmetric flows and strong colourings of oriented graphs
An implicit numerical scheme for the simulation of internal viscous flow on unstructured grids
How reliable is a computer-based proof?
A survey of graph coloring -- its types, methods and applications
Homomorphism bounded classes of graphs
The edge-face coloring of graphs embedded in a surface of characteristic zero
Hadwiger's conjecture for circular colorings of edge-weighted graphs
On the chromatic number of binary matroids
Domination parameters of a graph and its complement
Coloring plane graphs with independent crossings
Guthrie's problem: new equivalences and rapid reductions
Chromatic numbers of simplicial manifolds
Facially-constrained colorings of plane graphs: a survey
Bounds and fixed-parameter algorithms for weighted improper coloring
Bounds on the connected domination number of a graph
Rotation sequences and edge-colouring of binary tree pairs
Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
Chromatic numbers of quadrangulations on closed surfaces
Colorings and girth of oriented planar graphs
Maximum face-constrained coloring of plane graphs
Some Conjectures and Questions in Chromatic Topological Graph Theory
The edge version of Hadwiger's conjecture
An efficient parallel algorithm for computing a large independent set in a planar graph
Labelling planar graphs without 4-cycles with a condition on distance two
Colorings of plane graphs without long monochromatic facial paths
Uncertain vertex coloring problem
On Neighbourly Triangulations
On intersection representations of co-planar graphs
A note on half-planar geometries
The adjacent vertex distinguishing total coloring of planar graphs
scientific article; zbMATH DE number 2230310 (Why is no real title available?)
An annotated bibliography on 1-planarity
List 2-facial 5-colorability of plane graphs with girth at least 12
Cyclic colorings of plane graphs with independent faces
A complete classification of tractability in Allen's algebra relative to subsets of basic relations
Vector colorability
Distance constraints in graph color extensions
Improved square coloring of planar graphs
A Five-Color Theorem for Graphs on Surfaces
Entire colouring of plane graphs
WORM colorings of planar graphs
On coloring box graphs
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
Colouring Random Empire Trees
Graph theory. Abstracts from the workshop held January 2--8, 2022
Large independent sets in triangle-free planar graphs
Local neighbor-distinguishing index of graphs
Entire coloring of graphs embedded in a surface of nonnegative characteristic
On backbone coloring of graphs
The cost of perfection for matchings in graphs
Supereulerian graphs and excluded induced minors
Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
Transversals and colorings of simplicial spheres
Coloring Eulerian triangulations of the Klein bottle
The Zambelli Attractors of Coupled, Nonlinear Macrodynamics and Knot Theory
Unimodal sequences: from Isaac Newton to June Huh
Kempe classes and almost bipartite graphs
An improved upper bound on the edge-face coloring of 2-connected plane graphs
On zonal and inner zonal labelings of plane graphs of maximum degree 3
Entire coloring of 2-connected plane graphs
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
Rainbow subgraphs in edge-colored planar and outerplanar graphs
Edge-coloring of plane multigraphs with many colors on facial cycles
Partitioning planar graphs into bounded degree forests
Square Coloring Planar Graphs with Automatic Discharging
scientific article; zbMATH DE number 7528057 (Why is no real title available?)
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Large independent sets in subquartic planar graphs
scientific article; zbMATH DE number 3683613 (Why is no real title available?)
Zig-zag facial total-coloring of plane graphs
Complete Minors in Graphs Without Sparse Cuts
Ising spins on thin graphs
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Facial unique-maximum edge and total coloring of plane graphs
A note on 3-distance coloring of planar graphs
From realizability to induction via dependent intersection
A categorical setting for the 4-colour theorem
Cyclic 4-colorings of graphs on surfaces

This page was built for publication: Every planar map is four colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4097312)