Kempe equivalence of 4‐critical planar graphs
From MaRDI portal
Publication:6047640
DOI10.1002/jgt.22908zbMath1522.05063arXiv2101.04065OpenAlexW3119169073MaRDI QIDQ6047640
Publication date: 9 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.04065
Related Items (1)
Cites Work
- Unnamed Item
- Akempic triangulations with 4 odd vertices
- Kempe classes and the Hadwiger conjecture
- On 4-critical planar graphs with high edge density
- Geometric coloring theory
- Les 5-colorations d'un graphe planaire forment une classe de commutation unique
- Every planar graph is 5-choosable
- A short list color proof of Grötzsch's theorem
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- A not 3-choosable planar graph without 3-cycles
- Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
- Connectedness of the graph of vertex-colourings
- Improved bounds for sampling colorings
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
- The complexity of change
- Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs
- A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
- Shortest Reconfiguration of Colorings Under Kempe Changes
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- Diameter of colorings under Kempe changes
- Kempe equivalence of colourings of cubic graphs
This page was built for publication: Kempe equivalence of 4‐critical planar graphs
