Fast generation of cubic graphs
From MaRDI portal
Publication:4894617
DOI<139::AID-JGT5>3.0.CO;2-U 10.1002/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-UzbMath0858.05093OpenAlexW1979211274MaRDI QIDQ4894617
Publication date: 11 March 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199610)23:2<139::aid-jgt5>3.0.co;2-u
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
On 2-factors splitting an embedded graph into two plane graphs, Cuts in matchings of 3-connected cubic graphs, Switching 3-edge-colorings of cubic graphs, Computing the maximal canonical form for trees in polynomial time, 3- and 4-critical graphs of small even order, The minimality of the Georges–Kelmans graph, Breaking symmetries in graph search with canonizing sets, Generation of various classes of trivalent graphs, Breaking symmetries with high dimensional graph invariants and their combination, Enumerating Steiner triple systems, New bounds for the average genus and average number of faces of a simple graph, Errors in graph embedding algorithms, On stable cycles and cycle double covers of graphs with large circumference, Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures, Counting symmetric configurations \(v_3\), Generation and properties of snarks, Biangular lines revisited, A computer-assisted proof of the uniqueness of the Perkel graph, Variable neighborhood search: Principles and applications, Fast generation of regular graphs and construction of cages, To be or not to be Yutsis: algorithms for the decision problem, Distance degree regular graphs and distance degree injective graphs: an overview, Graph structural properties of non-Yutsis graphs allowing fast recognition, On the upper embedding of symmetric configurations with block size 3, Products of distance degree regular and distance degree injective graphs, A note on the smallest connected non-traceable cubic bipartite planar graph, Structure of cubic Lehman matrices, Trace-minimal graphs and D-optimal weighing designs, Computers and discovery in algebraic graph theory, A counterexample to the pseudo 2-factor isomorphic graph conjecture
