New constructions of hypohamiltonian and hypotraceable graphs
From MaRDI portal
(Redirected from Publication:4638645)
Recommendations
Cited in
(13)- Grinberg's criterion
- Gallai's question and constructions of almost hypotraceable graphs
- Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs
- On minimum leaf spanning trees and a criticality notion
- scientific article; zbMATH DE number 3849274 (Why is no real title available?)
- Improved bounds for hypo-Hamiltonian graphs
- K₂-Hamiltonian graphs: I
- On constructions of hypotraceable graphs
- On hypohamiltonian and almost hypohamiltonian graphs
- On non-Hamiltonian graphs for which every vertex-deleted subgraph is traceable
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
- K2‐Hamiltonian graphs: II
- Small planar Hypohamiltonian graphs
This page was built for publication: New constructions of hypohamiltonian and hypotraceable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638645)