Generation of various classes of trivalent graphs
From MaRDI portal
Publication:391389
DOI10.1016/J.TCS.2012.01.018zbMATH Open1301.05277OpenAlexW2036699382MaRDI QIDQ391389FDOQ391389
Authors: Gunnar Brinkmann, Tomaž Pisanski, Nico Van Cleemput 
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.018
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Generation of cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A classification of cubic bicirculants
- Isomorph-Free Exhaustive Generation
- Chromatic-index-critical graphs of orders 11 and 12
- Group actions, coverings and lifts of automorphisms
- Counting symmetric configurations \(v_3\)
- On tilings of the plane
- Hypermaps on surfaces with boundary
- Action graphs and coverings
- Edge-transitive maps of low genus
- Exotic behaviour of infinite hypermaps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast generation of cubic graphs
Cited In (8)
- Medial symmetry type graphs
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
- Transforming phylogenetic networks: moving beyond tree space
- Genus of the Cartesian product of triangles
- Symmetry type graphs of polytopes and maniplexes
- Generation of 3-connected, planar line graphs
- Symmetry type graphs on 4-orbit maps
- Generating weakly triangulated graphs
Uses Software
This page was built for publication: Generation of various classes of trivalent graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391389)
