Generation and new infinite families of K₂-hypohamiltonian graphs
From MaRDI portal
Publication:6542014
Recommendations
Cites work
- scientific article; zbMATH DE number 1011075 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- scientific article; zbMATH DE number 3313414 (Why is no real title available?)
- K2‐Hamiltonian graphs: II
- An Infinite Class of Hypohamiltonian Graphs
- Generation of cubic graphs
- House of graphs 2.0: a database of interesting graphs and more
- Improved bounds for hypo-Hamiltonian graphs
- Isomorph-Free Exhaustive Generation
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Planar cubic hypohamiltonian and hypotraceable graphs
- Practical graph isomorphism. II.
- Structural and computational results on platypus graphs
- \(K_2\)-Hamiltonian graphs: I
This page was built for publication: Generation and new infinite families of \(K_2\)-hypohamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542014)