GenerateUHG
From MaRDI portal
Software:38693
swMATH26974MaRDI QIDQ38693FDOQ38693
Author name not available (Why is that?)
Cited In (7)
- 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
- 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
