Geometric coloring theory
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3125737 (Why is no real title available?)
- scientific article; zbMATH DE number 3143361 (Why is no real title available?)
- scientific article; zbMATH DE number 3478905 (Why is no real title available?)
- scientific article; zbMATH DE number 3493594 (Why is no real title available?)
- scientific article; zbMATH DE number 3506733 (Why is no real title available?)
- scientific article; zbMATH DE number 3517180 (Why is no real title available?)
- scientific article; zbMATH DE number 3205927 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3308987 (Why is no real title available?)
- scientific article; zbMATH DE number 3086604 (Why is no real title available?)
- Buildings of spherical type and finite BN-pairs
- Chromatic Polynomials
- Colouring of Trivalent Polyhedra
- Combinatorial structure on triangulations. I: The structure of four colorings
- Combinatorial structures on triangulations. II: Local colorings
- Combinatorial structures on triangulations. III: Coloring with regular polyhedra
- Distribution of points of odd degree of certain triangulations in the plane
- Every generalized Petersen graph has a Tait coloring
- Graphs from projective planes
- Grotzsh's Heawood coloring theorem
- Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On Hamiltonian Circuits
- On the Four-Colour Conjecture
- Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
- Properties of planar graphs with uniform vertex and face structure.
- Self-dual configurations and regular graphs
- Some topological approaches to the four color problem
- THE EVENNESS OF THE NUMBER OF EDGES OF A CONVEX POLYHEDRON
- Transforming triangulations
- Wagner's theorem for torus graphs
Cited in
(29)- Simplicial moves on balanced complexes
- Balanced shellings and moves on balanced manifolds
- Inductive definition of two restricted classes of triangulations
- Kempe equivalence of colourings of cubic graphs
- Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs
- Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
- On purely tree-colorable planar graphs
- Galois connections and the Leray spectral sequence
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- Color-critical graphs on a fixed surface
- Introduction to reconfiguration
- Kempe equivalence of 4‐critical planar graphs
- Kempe classes and almost bipartite graphs
- Uniquely forced perfect matching and unique 3-edge-coloring
- Conical \(\mathrm{SL}(3)\) foams
- The non-existence of colorings
- Coloring Eulerian triangulations of the Klein bottle
- scientific article; zbMATH DE number 4218776 (Why is no real title available?)
- Octahedralizing \(3\)-colorable \(3\)-polytopes
- 5-chromatic even triangulations on the Klein bottle
- A common cover of graphs and 2-cell embeddings
- Strengthening a Theorem of Meyniel
- Kempe equivalence of colourings of cubic graphs
- Akempic triangulations with 4 odd vertices
- The enumeration of akempic triangulations
- You can't paint yourself into a corner
- The last temptation of William T. Tutte
- The \(a\)-graph coloring problem
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
This page was built for publication: Geometric coloring theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1239165)
