Cited in
(31)- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Extremal cubic graphs for fault-tolerant locating domination
- Generation of various classes of trivalent graphs
- Integer sequence discovery from small graphs
- Graphs with few Hamiltonian cycles
- Enumeration of Seidel matrices
- Existence of regular nut graphs for degree at most 11
- Secure sets and their expansion in cubic graphs
- MOLGEN
- nauty
- House of Graphs
- Traces
- plantri
- Buckygen
- GENREG
- GenerateUHG
- geng
- GenHypohamiltonian
- Triangleramsey
- Generation and properties of snarks
- Transforming phylogenetic networks: moving beyond tree space
- scientific article; zbMATH DE number 6472882 (Why is no real title available?)
- Constructing all nonisomorphic supergraphs with isomorphism rejection
- Improved bounds for hypo-Hamiltonian graphs
- Generation of cubic graphs and snarks with large girth
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Measures of edge-uncolorability of cubic graphs
- On the minimum leaf number of cubic graphs
- Switching 3-edge-colorings of cubic graphs
- On the smallest snarks with oddness 4 and connectivity 2
- A counterexample to the pseudo 2-factor isomorphic graph conjecture
This page was built for software: snarkhunter
