Hamilton connected graphs

Cited in

(only showing first 100 items - show all)

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

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)