Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs

DOI10.1016/j.disc.2014.02.014zbMath1288.05081arXiv1209.1730OpenAlexW2058532074MaRDI QIDQ2449143

Ruth Haas, Sarah-Marie Belcastro

Publication date: 6 May 2014

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

Full work available at URL: https://arxiv.org/abs/1209.1730

zbMATH Keywords

edge-coloringcubic graphscoloring graphsKempe chains

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Switching 3-edge-colorings of cubic graphs ⋮ Hamiltonian cycles and 1-factors in 5-regular graphs ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Kempe equivalence of colourings of cubic graphs ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ Graph edge coloring: a survey ⋮ Kempe equivalence of colourings of cubic graphs ⋮ Introduction to reconfiguration

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric coloring theory
• Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm

This page was built for publication: Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs