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.05093MaRDI QIDQ4894617

Gunnar Brinkmann

Publication date: 11 March 1997

zbMATH Keywords

cubic graph; graph generation; isomorphism test

Mathematics Subject Classification ID

05C85: Graph algorithms (graph-theoretic aspects)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Variable neighborhood search: Principles and applications, Generation of various classes of trivalent graphs, On stable cycles and cycle double covers of graphs with large circumference, Generation and properties of snarks, Errors in graph embedding algorithms, To be or not to be Yutsis: algorithms for the decision problem, Graph structural properties of non-Yutsis graphs allowing fast recognition, 3- and 4-critical graphs of small even order, Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures, A computer-assisted proof of the uniqueness of the Perkel graph, Computers and discovery in algebraic graph theory, Counting symmetric configurations \(v_3\), Distance degree regular graphs and distance degree injective graphs: an overview, A counterexample to the pseudo 2-factor isomorphic graph conjecture, Breaking symmetries in graph search with canonizing sets, Trace-minimal graphs and D-optimal weighing designs, Products of distance degree regular and distance degree injective graphs, Unnamed Item