Variations on the Hamiltonian Theme

Cited in

(59)

On the Hamilton connectivity of generalized Petersen graphs
The classification of Hamiltonian generalized Petersen graphs
Subgraphs intersecting any Hamiltonian cycle
On a construction of Thomassen
Scattering number and extremal non-Hamiltonian graphs
A result on Hamiltonian cycles in generalized Petersen graphs
Smallest maximally nonhamiltonian graphs
Maximum nonhamiltonian tough graphs
Smallest maximally nonhamiltonian graphs. II
New families of hypohamiltonian graphs
Panconnected graphs. II
Hamiltonian cycles in generalized Petersen graphs
On \((a,b)\)-consecutive Petersen graphs
On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
On hypohamiltonian graphs
Hamilton saturated hypergraphs of essentially minimum size
Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
On the Hamilton laceability of double generalized Petersen graphs
The maximum size of a nonhamiltonian graph with given order and connectivity
Constructing sparsest -Hamiltonian saturated k-uniform hypergraphs for a wide range of
2-spanning cyclability problems of some generalized Petersen graphs
Sufficient conditions for graphs to be spanning connected
Recognizing generalized Petersen graphs in linear time
On the minimum size of Hamilton saturated hypergraphs
Generalizations of the classics to spanning connectedness
Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs
On the number of edges in a minimum \(C_6\)-saturated graph
Revisit of Erdős-Gallai's theorem on the circumference of a graph
Hyper-Hamiltonian generalized Petersen graphs
Vertices missed by longest paths or circuits
Structural and computational results on platypus graphs
Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
From the Coxeter graph to the Klein graph
Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
Saturation numbers for families of graph subdivisions
K₂-Hamiltonian graphs: I
Spectral radius and Hamiltonian properties of graphs. II
On the size of maximally non-Hamiltonian digraphs
On hypohamiltonian and almost hypohamiltonian graphs
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
Further results on Hendry's Conjecture
Ordering Q-indices of graphs: given size and circumference
Saturation for the 3-uniform loose 3-cycle
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
K₂‐Hamiltonian graphs: II
Length of cycles in generalized Petersen graphs
Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems
Rainbow Hamiltonicity with large edge numbers
Rainbow Hamiltonicity and the spectral radius
Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
The saturation number of C₆
Cubic graphs having only k-cycles in each 2-factor
Distinguishing graphs via cycles
Some conditions for pancyclicity in t-tough graphs
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
Extending cycles in graphs
Cubic maximal nontraceable graphs
Hamilton-chain saturated hypergraphs

This page was built for publication: Variations on the Hamiltonian Theme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5648389)