On Eulerian and Hamiltonian Graphs and Line Graphs

Cited in

(only showing first 100 items - show all)

On \(s\)-Hamiltonian line graphs
A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
Lai's conditions for spanning and dominating closed trails
Exact algorithms for finding longest cycles in claw-free graphs
Collapsible graphs and Hamilton cycles of line graphs
Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs
Spanning trails in essentially 4-edge-connected graphs
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
Radius and subpancyclicity in line graphs
\(s\)-vertex pancyclic index
On stability of the hamiltonian index under contractions and closures
On line graphs and the Hamiltonian index
On the 2-factor index of a graph
Hamiltonicity in vertex envelopes of plane cubic graphs
Degree sums and dominating cycles
On the hamiltonian index of a graph
The Hamiltonian index of graphs
Hamiltonian jump graphs
A lower bound on the Hamiltonian path completion number of a line graph
Contractions of graphs with no spanning Eulerian subgraphs
Collapsible graphs and reductions of line graphs
On the connectedness of 3-line graphs
The hamiltonian index of a 2-connected graph
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
On line graphs of subcubic triangle-free graphs
On forbidden pairs implying Hamilton-connectedness
A simple upper bound for the hamiltonian index of a graph
On \(s\)-Hamiltonicity of net-free line graphs
Pancyclic and panconnected line graphs
Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
Hamiltonicity of complements of middle graphs
2-factors in claw-free graphs with lower bounds cycle lengths
On traceable line graphs
Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
Hamilton cycles and closed trails in iterated line graphs
Existence of spanning and dominating trails and circuits
On n-hamiltonian line graphs
Edge degree conditions for subpancyclicity in line graphs
Eulerian subgraphs containing given vertices and hamiltonian line graphs
On the hamiltonian index and the radius of a graph
Spanning trails containing given edges
Local search algorithms for finding the Hamiltonian completion number of line graphs
Minimum number of components of 2-factors in iterated line graphs
On Hamiltonicity of 2-connected claw-free graphs
The Chvátal-Erdős condition and pancyclic line-graphs
A result on Hamiltonian line graphs involving restrictions on induced subgraphs
The Hamiltonian index of a graph and its branch-bonds
Supereulerian graphs, independent sets, and degree-sum conditions
Generalizations of line graphs and applications
\(k\)-ordered hamiltonicity of iterated line graphs
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
The Chvátal-Erdős condition for a graph to have a spanning trail
The \(s\)-Hamiltonian index
On the Hamiltonian index
Closure, stability and iterated line graphs with a 2-factor
Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
Subgraph distances in graphs defined by edge transfers
On circuits and pancyclic line graphs
On pancyclic line graphs
scientific article; zbMATH DE number 7021376 (Why is no real title available?)
Contractions and hamiltonian line graphs
The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
Hamilton cycles in 6-connected claw-free graphs (extended abstract)
An \(s\)-Hamiltonian line graph problem
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
The spanning connectivity of line graphs
How many conjectures can you stand? A survey
The supereulerian graphs in the graph family \(C(l,k)\)
Circumferences and minimum degrees in 3-connected claw-free graphs
Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
On spanning tree packings of highly edge connected graphs
Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
Pancyclicity of hamiltonian line graphs
On 1-Hamilton-connected claw-free graphs
Hamiltonicity and minimum degree in 3-connected claw-free graphs
Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
A twelve vertex theorem for 3-connected claw-free graphs
Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
On hamiltonian line graphs of hypergraphs
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
A reduction method to find spanning Eulerian subgraphs
On 3-connected Hamiltonian line graphs
Reconstructing a graph from its arc incidence graph
On Computing the Hamiltonian Index of Graphs
Induced nets and Hamiltonicity of claw-free graphs
On Hamiltonicity of 3-connected claw-free graphs
Hamiltonicity in claw-free graphs
A note on minimum degree conditions for supereulerian graphs
On hamiltonian line graphs
Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
Supereulerian graphs: A survey
A note on collapsible graphs and super-Eulerian graphs
Hamilton-connected indices of graphs
Spanning trails
Forbidden subgraphs that imply 2-factors
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
2-factors and independent sets on claw-free graphs
Circumferences of 2-factors in claw-free graphs

This page was built for publication: On Eulerian and Hamiltonian Graphs and Line Graphs

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