Variations on the Hamiltonian Theme
From MaRDI portal
Publication:5648389
DOI10.4153/CMB-1972-012-3zbMath0238.05115MaRDI QIDQ5648389
Publication date: 1972
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items (50)
Subgraphs intersecting any Hamiltonian cycle ⋮ From the Coxeter Graph to the Klein Graph ⋮ On a construction of Thomassen ⋮ Scattering number and extremal non-Hamiltonian graphs ⋮ Cubic maximal nontraceable graphs ⋮ Structural and computational results on platypus graphs ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Sufficient conditions for graphs to be spanning connected ⋮ Further results on Hendry's Conjecture ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\) ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Recognizing generalized Petersen graphs in linear time ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ K2‐Hamiltonian graphs: II ⋮ A result on Hamiltonian cycles in generalized Petersen graphs ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ On the minimum size of Hamilton saturated hypergraphs ⋮ Smallest maximally nonhamiltonian graphs ⋮ Revisit of Erdős-Gallai's theorem on the circumference of a graph ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Maximum nonhamiltonian tough graphs ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius ⋮ Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems ⋮ Generalizations of the classics to spanning connectedness ⋮ Saturation numbers for families of graph subdivisions ⋮ Smallest maximally nonhamiltonian graphs. II ⋮ Hamilton-chain saturated hypergraphs ⋮ Hyper-Hamiltonian generalized Petersen graphs ⋮ New families of hypohamiltonian graphs ⋮ Panconnected graphs. II ⋮ Enumeration of Hamiltonian cycles in certain generalized Petersen graphs ⋮ Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs ⋮ Hamiltonian cycles in generalized Petersen graphs ⋮ On the Hamilton laceability of double generalized Petersen graphs ⋮ Extending cycles in graphs ⋮ On the size of maximally non-hamiltonian digraphs ⋮ Vertices missed by longest paths or circuits ⋮ On the Hamilton connectivity of generalized Petersen graphs ⋮ On hypohamiltonian graphs ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs ⋮ The classification of Hamiltonian generalized Petersen graphs ⋮ The maximum size of a nonhamiltonian graph with given order and connectivity ⋮ On \((a,b)\)-consecutive Petersen graphs ⋮ $K_2$-Hamiltonian Graphs: I ⋮ Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) ⋮ On the number of edges in a minimum \(C_6\)-saturated graph
This page was built for publication: Variations on the Hamiltonian Theme
