snarkhunter
From MaRDI portal
Software:38694
swMATH26975MaRDI QIDQ38694FDOQ38694
Author name not available (Why is that?)
Cited In (20)
- Secure sets and their expansion in cubic graphs
- On the minimum leaf number of cubic graphs
- Title not available (Why is that?)
- Generation and properties of snarks
- On the smallest snarks with oddness 4 and connectivity 2
- Transforming phylogenetic networks: moving beyond tree space
- Extremal cubic graphs for fault-tolerant locating domination
- Generation of various classes of trivalent graphs
- Improved bounds for hypohamiltonian graphs
- Measures of edge-uncolorability of cubic graphs
- CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Switching 3-edge-colorings of cubic graphs
- Existence of regular nut graphs for degree at most 11
- A counterexample to the pseudo 2-factor isomorphic graph conjecture
- Integer sequence discovery from small graphs
- Generation of Cubic Graphs and Snarks with Large Girth
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Enumeration of Seidel matrices
- Graphs with few hamiltonian cycles
This page was built for software: snarkhunter
