Edge-Kempe classes in planar regular graphs

DOI10.1007/S00373-026-03060-6MaRDI QIDQ7402299zbMATH OpenFDO

Authors Nico Van Cleemput, Carol T. Zamfirescu

Publication date 2026

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-026-03060-6

zbMATH Keywords

1-factoredge-colouringHamiltonianplanarregular

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A simple and fast heuristic algorithm for edge-coloring of graphs
• Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
• Edge-Kempe-equivalence graphs of class-1 regular graphs
• Generation of simple quadrangulations of the sphere
• Geometric coloring theory
• Hamiltonian cycles and 1-factors in 5-regular graphs
• scientific article; zbMATH DE number 5130739 (Why is no real title available?)
• scientific article; zbMATH DE number 3627230 (Why is no real title available?)
• Kempe equivalence classes of cubic graphs embedded on the projective plane
• Kempe equivalence of edge-colorings in subcubic and subquartic graphs
• Switching 3-edge-colorings of cubic graphs

This page was built for publication: Edge-Kempe classes in planar regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402299)