Kempe classes and almost bipartite graphs
From MaRDI portal
Publication:6611011
DOI10.1016/J.DAM.2024.05.043zbMATH Open1547.05091MaRDI QIDQ6611011
Daniel W. Cranston, Carl Feghali
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the chromatic index of multigraphs without large triangles
- A new method of proving theorems on chromatic index
- Kempe classes and the Hadwiger conjecture
- Geometric coloring theory
- Les 5-colorations d'un graphe planaire forment une classe de commutation unique
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Graph edge coloring: a survey
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
- Introduction to reconfiguration
- On Vizing's edge colouring question
- The complexity of change
- Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs
- Every planar map is four colorable
- The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4
- A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- Kempe equivalence of colourings of cubic graphs
- Kempe equivalence of 4‐critical planar graphs
- Kempe equivalent list edge-colorings of planar graphs
- Kempe equivalent list colorings
- Strengthening a Theorem of Meyniel
- On an estimate of the chromatic class of a \(p\)-graph
This page was built for publication: Kempe classes and almost bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611011)
