Every Planar Map is Four Colorable
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Nowhere-zero 4-flow in almost Petersen-minor free graphs
- Volume estimates for equiangular hyperbolic Coxeter polyhedra
- Vivid: a framework for heterogeneous problem solving
- The four color proof suffices
- On cyclic colorings and their generalizations
- A self-stabilizing algorithm for coloring planar graphs
- The four-colour theorem
- Lie algebras and the four color theorem
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Edge colorings of graphs embeddable in a surface of low genus
- Facial incidence colorings of embedded multigraphs
- A note on not-4-list colorable planar graphs
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Improved bounds for guarding plane graphs with edges
- The extremal function and Colin de Verdière graph parameter
- Network pollution games
- Tait colorings, and an instanton homology for webs and foams
- Cyclic, diagonal and facial colorings
- Choosability, edge choosability and total choosability of outerplane graphs
- Surfaces, tree-width, clique-minors, and partitions
- Coloring the faces of convex polyhedra so that like colors are far apart
- Computers and discovery in algebraic graph theory
- Coverage with k-transmitters in the presence of obstacles
- A deformation of instanton homology for webs
- Maximal distance spectral radius of 4-chromatic planar graphs
- Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors
- Political districting to minimize cut edges
- Say no to case analysis: automating the drudgery of case-based proofs
- Computer-assisted estimates for Birkhoff normal forms
- Foam evaluation and Kronheimer-Mrowka theories
- Linear algebraic approach to an edge-coloring result
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- Information-sharing in social networks
- Polynomial hierarchy graph properties in hybrid logic
- Transition polynomials
- Reflexive coloring complexes for 3-edge-colorings of cubic graphs
- Big Math and the one-brain barrier: the tetrapod model of mathematical knowledge
- Open problems on graph coloring for special graph classes
- Formalizing Frankl's conjecture: FC-families
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- On a Heawood-type problem for maps with tangencies
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- An unavoidable set of D-reducible configurations
- scientific article; zbMATH DE number 3851119 (Why is no real title available?)
- On Vertex Partitions and the Colin de Verdière Parameter
- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
- Polyhedral embeddings of snarks in orientable surfaces
- TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS
- A general upper bound for the cyclic chromatic number of 3-connected plane graphs
- scientific article; zbMATH DE number 4066920 (Why is no real title available?)
- Challenges to the assessment of time-to-proof of mathematical conjectures
- scientific article; zbMATH DE number 107606 (Why is no real title available?)
- scientific article; zbMATH DE number 140087 (Why is no real title available?)
- scientific article; zbMATH DE number 1264993 (Why is no real title available?)
- scientific article; zbMATH DE number 1275149 (Why is no real title available?)
- scientific article; zbMATH DE number 1021588 (Why is no real title available?)
- Computer-assisted proof of performance ratios for the differencing method
- From the plane to higher surfaces
- Some probabilistic restatements of the Four Color Conjecture
- Introduction to rigorous numerics in dynamics: General functional analytic setup and an example that forces chaos
- Signature and concordance of positive knots
- Zero-sum flows of the linear lattice.
- Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors
- One More Probabilistic Reformulation of the Four Colour Conjecture
- An introduction to the discharging method via graph coloring
- Separating sets of strings by finding matching patterns is almost always hard
- Improved bounds for guarding plane graphs with edges
- Nowhere-zero bases for the nullspace of the incidence matrices of graphs
- Six-Critical Graphs on the Klein Bottle
- Right-angled polyhedra and hyperbolic 3-manifolds
- Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
- Clustered 3-colouring graphs of bounded degree
- Steinberg-like theorems for backbone colouring
- Some arithmetical restatements of the four color conjecture
- Mod 3 arithmetic on triangulated Riemann surfaces
- Hopf algebras and the Penrose polynomial
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
- Proper orientations and proper chromatic number
- Wheels in planar graphs and Hajós graphs
- 4‐Separations in Hajós graphs
- Computer Bounds for Kronheimer–Mrowka Foam Evaluation
- On word-representable and multi-word-representable graphs
- Strengthening a Theorem of Meyniel
- Local Hadwiger's conjecture
- Speaking to the public: mathematicians on American radio, the 1920s through the 1940s
- Parity vertex colouring of plane graphs
- Field-gradient partitioning for fracture and frictional contact in the material point method
- Looseness of plane graphs
- A formal proof of R(4,5)=25
- On the d-independence number in 1-planar graphs
- Colouring the 1-skeleton of d-dimensional triangulations
- On the independence number of 1-planar graphs
- Edge coloring lattice graphs
- New results on type 2 snarks
- The ratio of homology rank to hyperbolic volume. II: The role of the four color theorem
- Rotation sequences and edge-colouring of binary tree pairs
- Five-coloring graphs on the Klein bottle
- DP color functions of hypergraphs
- Differential graded algebras for trivalent plane graphs and their representations
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 Q3993359)
