Cites work
- A systematic approach to the determination of reducible configurations in the four-color conjecture
- scientific article; zbMATH DE number 3298600 (Why is no real title available?)
- scientific article; zbMATH DE number 3399266 (Why is no real title available?)
- The existence of unavoidable sets of geographically good configurations
Cited in
(only showing first 100 items - show all)- The edge version of Hadwiger's conjecture
- The edge-face coloring of graphs embedded in a surface of characteristic zero
- deBruijn-like sequences and the irregular chromatic number of paths and cycles
- Vector colorability
- A note on half-planar geometries
- 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 complete classification of tractability in Allen's algebra relative to subsets of basic relations
- Antisymmetric flows and strong colourings of oriented graphs
- Simultaneous coloring of edges and faces of plane graphs
- Colorings and girth of oriented planar graphs
- An implicit numerical scheme for the simulation of internal viscous flow on unstructured grids
- On intersection representations of co-planar graphs
- Maximum face-constrained coloring of plane graphs
- Ising spins on thin graphs
- Domination parameters of a graph and its complement
- Induced 2-degenerate subgraphs of triangle-free planar graphs
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- An algebraic approach to the planar coloring problem
- On local transformation of polygons with visibility properties.
- Extending precolorings of subgraphs of locally planar graphs
- A categorical setting for the 4-colour theorem
- Supereulerian graphs and excluded induced minors
- Coloring Eulerian triangulations of the Klein bottle
- Ugly mathematics: why do mathematicians dislike computer-assisted proofs?
- Uncertain vertex coloring problem
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
- Strict neighbor-distinguishing total index of graphs
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
- Edge-coloring of plane multigraphs with many colors on facial cycles
- A survey on the cyclic coloring and its relaxations
- Facial achromatic number of triangulations on the sphere
- Edge-partition and star chromatic index
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Dominated colorings of graphs
- Homomorphism bounded classes of graphs
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Even-cycle decompositions of graphs with no odd-K₄-minor
- Facially-constrained colorings of plane graphs: a survey
- An annotated bibliography on 1-planarity
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
- Strong chromatic index of K₄-minor free graphs
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- On the vertex-arboricity of planar graphs
- Maximal strip recovery problem with gaps: hardness and approximation algorithms
- The adjacent vertex distinguishing total coloring of planar graphs
- Bounds on the connected domination number of a graph
- A bound on the chromatic number of the square of a planar graph
- Book embedding of locally planar graphs on orientable surfaces
- From realizability to induction via dependent intersection
- Colorings of plane graphs without long monochromatic facial paths
- Facial unique-maximum edge and total coloring of plane graphs
- Entire coloring of 2-connected plane graphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Improved square coloring of planar graphs
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Local neighbor-distinguishing index of graphs
- Bicircular matroids are 3-colorable
- Chromatic numbers of quadrangulations on closed surfaces
- Large independent sets in subquartic planar graphs
- A survey of graph coloring -- its types, methods and applications
- The cost of perfection for matchings in graphs
- Coloring plane graphs with independent crossings
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- Cyclic 4-colorings of graphs on surfaces
- A Five-Color Theorem for Graphs on Surfaces
- Colouring Random Empire Trees
- On Neighbourly Triangulations
- On the chromatic number of binary matroids
- scientific article; zbMATH DE number 3683613 (Why is no real title available?)
- On backbone coloring of graphs
- Facial parity edge colouring of plane pseudographs
- Zig-zag facial total-coloring of plane graphs
- On coloring box graphs
- The Zambelli Attractors of Coupled, Nonlinear Macrodynamics and Knot Theory
- Asymptotic dimension of planes and planar graphs
- Complete Minors in Graphs Without Sparse Cuts
- scientific article; zbMATH DE number 7528057 (Why is no real title available?)
- WORM colorings of planar graphs
- Large independent sets in triangle-free planar graphs
- Topological Graph Theory: A Personal Account
- Some Conjectures and Questions in Chromatic Topological Graph Theory
- scientific article; zbMATH DE number 2230310 (Why is no real title available?)
- Graph theory (algorithmic, algebraic, and metric problems)
- Steinberg-like theorems for backbone colouring
- Rainbow subgraphs in edge-colored planar and outerplanar graphs
- On zonal and inner zonal labelings of plane graphs of maximum degree 3
- Clique minors in graphs with a forbidden subgraph
- Square Coloring Planar Graphs with Automatic Discharging
- Transversals and colorings of simplicial spheres
- Entire colouring of plane graphs
- A note on 3-distance coloring of planar graphs
- List 2-facial 5-colorability of plane graphs with girth at least 12
- Partitioning planar graphs into bounded degree forests
- Kempe classes and almost bipartite graphs
- An improved upper bound on the edge-face coloring of 2-connected plane graphs
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- Cyclic colorings of plane graphs with independent faces
- Unimodal sequences: from Isaac Newton to June Huh
- Guthrie's problem: new equivalences and rapid reductions
- A note on the r-hued coloring of planar 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)
