Hamilton connected graphs

Cited in

(95)

Spectral analogues of Erdős' theorem on Hamilton-connected graphs
Vertex pancyclic graphs
Reciprocal degree distance and Hamiltonian properties of graphs
Spanning 3-ended trees in almost claw-free graphs
Uniform number of a graph
Scattering number and extremal non-Hamiltonian graphs
A degree sum condition for graphs to be covered by two cycles
On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
On the spanning connectivity and spanning laceability of hypercube-like networks
One-to-one disjoint path covers on k-ary n-cubes
On prisms, Möbius ladders and the cycle space of dense graphs
On cubic 2-independent Hamiltonian connected graphs
Application of complex networks theory in urban traffic network researches
Proof of a conjecture of Haeggkvist on cycles and independent edges
On spanning connected graphs
On mutually independent Hamiltonian paths
On \(k\)-path pancyclic graphs
Circuits through specified edges
Spanning trees: A survey
Survey on path and cycle embedding in some networks
On the normalized Laplacian spectral radius of traceable graphs
The number of disjoint perfect matchings in semi-regular graphs
Highly irregular
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
On a k-tree containing specified leaves in a graph
Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
Covering the vertices of a digraph by cycles of prescribed length
Long paths with endpoints in given vertex-subsets of graphs
Spectral radius and Hamiltonicity of graphs with large minimum degree.
Wheel and star-critical Ramsey numbers for quadrilateral
Improved degree conditions for Hamiltonian properties
Uniformly connected graphs -- a survey
On the number of disjoint perfect matchings of regular graphs with given edge connectivity
Paired many-to-many disjoint path covers of hypertori
Hamilton-connectivity of line graphs with application to their detour index
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
The property of Hamiltonian connectedness in Toeplitz graphs
A sufficient condition for 𝑘-path Hamiltonian digraphs
Hamiltonian-connected graphs
Edge bounds in nonhamiltonian k-connected graphs
The spanning laceability on the faulty bipartite hypercube-like networks
Maximale Kreise in Graphen
On a spanning \(K\)-tree containing specified vertices in a graph
Some sufficient conditions for graphs being \(k\)-leaf-connected
2-tone coloring of chordal and outerplanar graphs
Extremal problems on the Hamiltonicity of claw-free graphs
Panconnected graphs. II
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
Hamiltonian paths and hamiltonian connectivity in graphs
Ore-type degree conditions for disjoint path covers in simple graphs
On n-distant Hamiltonian line graphs
Spanning subdivisions in Dirac graphs
Graph theory
Vertex pancyclic graphs
On the extremal number of edges in Hamiltonian connected graphs
Minimum degree ensuring that a hypergraph is Hamiltonian-connected
Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
Subdivision extendibility
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
Hamiltonicity in Partly claw-free graphs
Extended Keller graph and its properties
Degree conditions for spanning brooms
Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
Sufficient conditions for graphs to be spanning connected
Path connected graphs
Improved sufficient conditions for Hamiltonian properties
A sufficient condition for a graph to contain two disjoint Hamiltonian cycles
Some sufficient conditions for graphs to be \(k\)-leaf-connected
Theory of path length distributions. I
Conditional fault hamiltonian connectivity of the complete graph
Hamiltonian cycles in Dirac graphs
Graphs uniquely Hamiltonian-connected from a vertex
The existence of \(f\)-forests and \(f\)-trees in graphs
Maximum non-path-connected graphs
Spectral radius and Hamiltonian properties of graphs. II
On the spanning fan-connectivity of graphs
Degree sequence conditions for a graph to be disjoint path coverable
Extending matchings in graphs: A survey
A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph
Degree sums and spanning brooms of a graph
Path extendable graphs
On a spanning tree with specified leaves
On path connected graphs
Vertex-bipancyclicity in a bipartite graph collection
The square of a block is Hamiltonian connected
Hamiltonian extendable graphs
On k-path Hamiltonian graphs and line-graphs
Stars and their \(k\)-Ramsey numbers
An asymptotic version of a conjecture by Enomoto and Ota
On k-leaf-connected graphs
On n-distant Hamiltonian line graphs
A Fan-type condition for graphs to be \(k\)-leaf-connected

This page was built for publication: Hamilton connected graphs

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