Switching 3-edge-colorings of cubic graphs
From MaRDI portal
Publication:2144509
DOI10.1016/j.disc.2022.112963zbMath1491.05078arXiv2105.01363OpenAlexW3158489310MaRDI QIDQ2144509
Jan Goedgebeur, Patric R. J. Östergård
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.01363
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pasch trades with a negative block
- Generation and properties of snarks
- Switching codes and designs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Classification algorithms for codes and designs
- Improved edge-coloring with three colors
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Graph edge coloring: a survey
- House of Graphs: a database of interesting graphs
- Enumerating the edge-colourings and total colourings of a regular graph
- Subcubic trades in Steiner triple systems
- Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- The NP-Completeness of Edge-Coloring
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
- Some new perfect Steiner triple systems
- The Steiner triple systems of order 19
- Fast generation of cubic graphs
- Graphs with few hamiltonian cycles
- The Traveling Salesman Problem for Cubic Graphs
- The Generation of Fullerenes
This page was built for publication: Switching 3-edge-colorings of cubic graphs