Generation of various classes of trivalent graphs

Authors:
Gunnar Brinkmann;Nico Van Cleemput;Toma Pisanski
Affiliations:
Applied Mathematics and Computer Science, Ghent University, B-9000 Ghent, Krijgslaan 281-S9, Belgium;Applied Mathematics and Computer Science, Ghent University, B-9000 Ghent, Krijgslaan 281-S9, Belgium;Department of Theoretical Computer Science, IMFM, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia
Venue:
Theoretical Computer Science
Year:
2013

Citing 8
Cited 0

Topological graph theory

Topological graph theory
Hypermaps on surfaces with boundary

European Journal of Combinatorics
Fast generation of cubic graphs

Journal of Graph Theory
Group actions, coverings and lifts of automorphisms

Discrete Mathematics - Special issue on Graph theory
Isomorph-free exhaustive generation

Journal of Algorithms
Chromatic-index-critical graphs of orders 11 and 12

European Journal of Combinatorics
Counting symmetric configurations v3

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Action graphs and coverings

Discrete Mathematics - Algebraic and topological methods in graph theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection with maps, hypermaps, configurations, polytopes, or covering graphs. In this paper, we briefly explore these connections and give motivation why some classes of cubic graphs should be generated. Then we describe the algorithms we used to generate these classes. The results are presented in various tables.