Every planar map is four colorable

Cites Work

The existence of unavoidable sets of geographically good configurations
A systematic approach to the determination of reducible configurations in the four-color conjecture
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

A survey on the cyclic coloring and its relaxations
A note on 3-distance coloring of planar graphs
Square Coloring Planar Graphs with Automatic Discharging
Transversals and colorings of simplicial spheres
Partitioning planar graphs into bounded degree forests
Edge-partition and star chromatic index
Strict neighbor-distinguishing total index of graphs
Induced 2-degenerate subgraphs of triangle-free planar graphs
From realizability to induction via dependent intersection
A categorical setting for the 4-colour theorem
The Zambelli Attractors of Coupled, Nonlinear Macrodynamics and Knot Theory
Kempe classes and almost bipartite graphs
An improved upper bound on the edge-face coloring of 2-connected plane graphs
A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
On zonal and inner zonal labelings of plane graphs of maximum degree 3
Edge-coloring of plane multigraphs with many colors on facial cycles
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Zig-zag facial total-coloring of plane graphs
Facial unique-maximum edge and total coloring of plane graphs
Topological Graph Theory: A Personal Account
Book embedding of locally planar graphs on orientable surfaces
Clique minors in graphs with a forbidden subgraph
Coloring Eulerian triangulations of the Klein bottle
Entire coloring of 2-connected plane graphs
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
Title not available (Why is that?)
Ugly mathematics: why do mathematicians dislike computer-assisted proofs?
Cyclic 4-Colorings of Graphs on Surfaces
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Complete Minors in Graphs Without Sparse Cuts
Large Independent Sets in Subquartic Planar Graphs
The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
Unimodal sequences: from Isaac Newton to June Huh
Strong chromatic index of \(K_4\)-minor free graphs
Rainbow subgraphs in edge-colored planar and outerplanar graphs
Ising spins on thin graphs
Title not available (Why is that?)
Facial parity edge colouring of plane pseudographs
On the chromatic number of binary matroids
Large Independent Sets in Triangle-Free Planar Graphs
Improved square coloring of planar graphs
Vector colorability
Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
On coloring box graphs
Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
Bicircular matroids are 3-colorable
On local transformation of polygons with visibility properties.
Entire colouring of plane graphs
Supereulerian graphs and excluded induced minors
Antisymmetric flows and strong colourings of oriented graphs
Rotation sequences and edge-colouring of binary tree pairs
A survey of graph coloring - its types, methods and applications
Graph theory. Abstracts from the workshop held January 2--8, 2022
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
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)
Facial entire colouring of plane graphs
A complete classification of tractability in Allen's algebra relative to subsets of basic relations
The cost of perfection for matchings in graphs
Simultaneous coloring of edges and faces of plane graphs
Graph theory (algorithmic, algebraic, and metric problems)
Title not available (Why is that?)
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
Local neighbor-distinguishing index of graphs
Adjacent vertex distinguishing total colorings of outerplanar graphs
Asymptotic dimension of planes and planar graphs
Distance constraints in graph color extensions
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
Colorings and girth of oriented planar graphs
On intersection representations of co-planar graphs
Domination parameters of a graph and its complement
On Neighbourly Triangulations
Dominated colorings of graphs
Some Conjectures and Questions in Chromatic Topological Graph Theory
Uncertain vertex coloring problem
A note on half-planar geometries
Entire coloring of graphs embedded in a surface of nonnegative characteristic
Labelling planar graphs without 4-cycles with a condition on distance two
An algebraic approach to the planar coloring problem
The edge-face coloring of graphs embedded in a surface of characteristic zero
Maximum face-constrained coloring of plane graphs
Homomorphism bounded classes of graphs
Extending precolorings of subgraphs of locally planar graphs
Colorings of plane graphs without long monochromatic facial paths
Colouring Random Empire Trees
Steinberg-like theorems for backbone colouring
How reliable is a computer-based proof?
The adjacent vertex distinguishing total coloring of planar graphs
An annotated bibliography on 1-planarity
deBruijn-like sequences and the irregular chromatic number of paths and cycles
Unique-maximum edge-colouring of plane graphs with respect to faces
A Five-Color Theorem for Graphs on Surfaces
On the vertex-arboricity of planar graphs
The edge version of Hadwiger's conjecture
Facial achromatic number of triangulations on the sphere
The thickness and chromatic number of \(r\)-inflated graphs
Hadwiger's conjecture for circular colorings of edge-weighted graphs

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)