Dataset and code for Switching 3-edge-colorings of cubic graphs

Description

This dataset contains the cubic graphs with the maximum number of edge-Kempe equivalence classes up to 30 vertices as well the code which we implemented and used to determine the number of edge-Kempe equivalence classes of cubic input graphs. See: "J. Goedgebeur and P.R.J. Östergård, Switching 3-edge-colorings of cubic graphs, arXiv preprint arXiv:2105.01363, 2021" for more information. The graphs are stored in graph6 format (see http://users.cecs.anu.edu.au/~bdm/data/formats.html for more information on this format).
Show more

Year of publication

2021

Type of data

Authors

Department of Communications and Networking

Patric Östergård Orcid -palvelun logo - Creator

KU Leuven

Jan Goedgebeur - Creator

Zenodo - Publisher

Project

Other information

Fields of science

Mathematics

Language

Open access

Open

License

Creative Commons Attribution 4.0 International (CC BY 4.0)

Keywords

Subject headings

Temporal coverage

undefined

Related to this research data