GenerateUHG
From MaRDI portal
Cited in
(14)- Regular graphs with few longest cycles
- Highly-connected planar cubic graphs with few or many Hamilton cycles
- Graphs with few Hamiltonian cycles
- On interval transmission irregular graphs
- House of Graphs
- plantri
- MathOverflow
- GENREG
- geng
- GenHypohamiltonian
- snarkhunter
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Switching 3-edge-colorings of cubic graphs
- \(4\)-regular \(4\)-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles
This page was built for software: GenerateUHG
