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