Fast generation of cubic graphs

DOI10.1002/(SICI)1097-0118(199610)23:2%3C139::AID-JGT5%3E3.0.CO;2-UMaRDI QIDQ4894617zbMATH OpenOpenAlexFDO

Authors Gunnar Brinkmann

Publication date 11 March 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199610)23:2%3C139::aid-jgt5%3E3.0.co;2-u

zbMATH Keywords

cubic graphgraph generationisomorphism test

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Generation of cubic graphs
• Fast generation of regular graphs and construction of cages
• Generating random regular graphs
• Fast uniform generation of regular graphs

Cited in

(38)

• The minimality of the Georges-Kelmans graph
• A note on the smallest connected non-traceable cubic bipartite planar graph
• Generation of cubic graphs and snarks with large girth
• Structure of cubic Lehman matrices
• Enumerating Steiner triple systems
• Computers and discovery in algebraic graph theory
• Counting symmetric configurations \(v_3\)
• Biangular lines revisited
• To be or not to be Yutsis: algorithms for the decision problem
• On 2-factors splitting an embedded graph into two plane graphs
• Generation and properties of snarks
• Variable neighborhood search: Principles and applications
• Distance degree regular graphs and distance degree injective graphs: an overview
• Trace-minimal graphs and D-optimal weighing designs
• Cuts in matchings of 3-connected cubic graphs
• Breaking symmetries in graph search with canonizing sets
• Computing the maximal canonical form for trees in polynomial time
• On stable cycles and cycle double covers of graphs with large circumference
• Graph structural properties of non-Yutsis graphs allowing fast recognition
• Finding periodic apartments via Boolean satisfiability and orderly generation
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Generation of various classes of trivalent graphs
• Breaking symmetries with high dimensional graph invariants and their combination
• Products of distance degree regular and distance degree injective graphs
• A computer-assisted proof of the uniqueness of the Perkel graph
• scientific article; zbMATH DE number 4158673 (Why is no real title available?)
• Switching 3-edge-colorings of cubic graphs
• Errors in graph embedding algorithms
• New bounds for the average genus and average number of faces of a simple graph
• A counterexample to the pseudo 2-factor isomorphic graph conjecture
• Fast generation of regular graphs and construction of cages
• On the twin-width of near-regular graphs
• Generating regular directed graphs
• Generating incidence structures with given girth
• A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
• On the upper embedding of symmetric configurations with block size 3
• 3- and 4-critical graphs of small even order
• Generation of cubic graphs

This page was built for publication: Fast generation of cubic graphs

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