The following pages link to Fast generation of cubic graphs (Q4894617):
Displaying 27 items.
- Generation of various classes of trivalent graphs (Q391389) (← links)
- On stable cycles and cycle double covers of graphs with large circumference (Q442360) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Errors in graph embedding algorithms (Q632808) (← links)
- To be or not to be Yutsis: algorithms for the decision problem (Q709830) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Cuts in matchings of 3-connected cubic graphs (Q1633599) (← links)
- A computer-assisted proof of the uniqueness of the Perkel graph (Q1766104) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Counting symmetric configurations \(v_3\) (Q1962053) (← links)
- Distance degree regular graphs and distance degree injective graphs: an overview (Q2018961) (← links)
- On 2-factors splitting an embedded graph into two plane graphs (Q2121487) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Biangular lines revisited (Q2230922) (← links)
- On the upper embedding of symmetric configurations with block size 3 (Q2297727) (← links)
- A note on the smallest connected non-traceable cubic bipartite planar graph (Q2319723) (← links)
- Structure of cubic Lehman matrices (Q2325755) (← links)
- A counterexample to the pseudo 2-factor isomorphic graph conjecture (Q2354717) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Trace-minimal graphs and D-optimal weighing designs (Q2576216) (← links)
- Computing the maximal canonical form for trees in polynomial time (Q2636446) (← links)
- Products of distance degree regular and distance degree injective graphs (Q2833285) (← links)
- The minimality of the Georges–Kelmans graph (Q5070550) (← links)
- Enumerating Steiner triple systems (Q6064438) (← links)
- New bounds for the average genus and average number of faces of a simple graph (Q6080141) (← links)
