Geometric coloring theory

DOI10.1016/S0001-8708(77)80048-0zbMath0358.05023MaRDI QIDQ1239165

Steve Fisk

Publication date: 1977

Published in: Advances in Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (28)

On purely tree-colorable planar graphs ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Conical \(\mathrm{SL}(3)\) foams ⋮ Color-critical graphs on a fixed surface ⋮ Octahedralizing \(3\)-colorable \(3\)-polytopes ⋮ Simplicial moves on balanced complexes ⋮ Coloring Eulerian triangulations of the Klein bottle ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Strengthening a Theorem of Meyniel ⋮ Kempe equivalence of colourings of cubic graphs ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ Balanced shellings and moves on balanced manifolds ⋮ Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs ⋮ The last temptation of William T. Tutte ⋮ The \(a\)-graph coloring problem ⋮ Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs ⋮ The non-existence of colorings ⋮ Galois connections and the Leray spectral sequence ⋮ Kempe equivalence of colourings of cubic graphs ⋮ Kempe classes and almost bipartite graphs ⋮ You can't paint yourself into a corner ⋮ Introduction to reconfiguration ⋮ 5-chromatic even triangulations on the Klein bottle ⋮ A common cover of graphs and 2-cell embeddings ⋮ Akempic triangulations with 4 odd vertices ⋮ Inductive definition of two restricted classes of triangulations ⋮ The enumeration of akempic triangulations ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distribution of points of odd degree of certain triangulations in the plane
• Buildings of spherical type and finite BN-pairs
• Grotzsh's Heawood coloring theorem
• Graphs from projective planes
• 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
• Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
• Every generalized Petersen graph has a Tait coloring
• Wagner's theorem for torus graphs
• Transforming triangulations
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Some topological approaches to the four color problem
• Colouring of Trivalent Polyhedra
• Properties of planar graphs with uniform vertex and face structure.
• Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
• THE EVENNESS OF THE NUMBER OF EDGES OF A CONVEX POLYHEDRON
• On the Four-Colour Conjecture
• Self-dual configurations and regular graphs
• On Hamiltonian Circuits
• Chromatic Polynomials

This page was built for publication: Geometric coloring theory