On Eulerian and Hamiltonian Graphs and Line Graphs

Cited in

(only showing first 100 items - show all)

Edge-connectivity and edge-disjoint spanning trees
k-ordered hamiltonicity of iterated line graphs
Circumferences and minimum degrees in 3-connected claw-free graphs
Collapsible graphs and reductions of line graphs
Hamiltonian connectedness in 3-connected line graphs
Traceability of line graphs
The supereulerian graphs in the graph family \(C(l,k)\)
Hamiltonicity in vertex envelopes of plane cubic graphs
Hamilton-connected indices of graphs
Closure, stability and iterated line graphs with a 2-factor
Finding minimum dominating cycles in permutation graphs
On the Hamiltonian index
On pancyclic line graphs
The Chvátal-Erdős condition and pancyclic line-graphs
Contractions of graphs with no spanning Eulerian subgraphs
On line graphs and the Hamiltonian index
Existence of dominating cycles and paths
Hamiltonicity in claw-free graphs
On n-hamiltonian line graphs
Traversability and connectivity of the middle graph of a graph
Generalizations of line graphs and applications
On dominating and spanning circuits in graphs
On the hamiltonian index of a graph
A simple upper bound for the hamiltonian index of a graph
Subgraph distances in graphs defined by edge transfers
Supereulerian graphs, independent sets, and degree-sum conditions
Eulerian subgraphs containing given vertices and hamiltonian line graphs
On the hamiltonian index and the radius of a graph
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
Edge degree conditions for subpancyclicity in line graphs
A note on minimum degree conditions for supereulerian graphs
Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
Degree sum and Hamiltonian-connected line graphs
Hamiltonicity of claw-free graphs and Fan-type conditions
Pairs of forbidden subgraphs and 2-connected supereulerian graphs
Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
Hamiltonian jump graphs
Eulerian subgraphs and Hamilton-connected line graphs
Pancyclicity of hamiltonian line graphs
Hamiltonicity and minimum degree in 3-connected claw-free graphs
The Hamiltonian index of a graph and its branch-bonds
Reconstructing a graph from its arc incidence graph
s-vertex pancyclic index
On Hamiltonicity of 2-connected claw-free graphs
Exact algorithms for finding longest cycles in claw-free graphs
DNA origami and the complexity of Eulerian circuits with turning costs
Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
Induced nets and Hamiltonicity of claw-free graphs
Supereulerian line graphs
\( 1 / 2\)-conjectures on the domination game and claw-free graphs
On the extended Clark-Wormold Hamiltonian-like index problem
Complete family reduction and spanning connectivity in line graphs
On the dominating (induced) cycles of iterated line graphs
A condition on Hamilton-connected line graphs
Hamiltonian line graphs with local degree conditions
Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
On the s-hamiltonianicity of an hourglass-free line graph
Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
Hamilton cycles in line graphs of 3-hypergraphs
Thomassen's conjecture for line graphs of 3-hypergraphs
Forbidden subgraphs on Hamiltonian index
A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
On sufficient degree conditions for traceability of claw-free graphs
Chvátal-Erdős conditions and almost spanning trails
Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
On s-Hamiltonicity of net-free line graphs
On the line graph of a graph with diameter 2
Degree sums and dominating cycles
Extending perfect matchings to Hamiltonian cycles in line graphs
Multigraphic degree sequences and Hamiltonian-connected line graphs
Lai's conditions for spanning and dominating closed trails
2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
The Nash-Williams conjecture and the dominating cycle conjecture
On the independence number of traceable 2-connected claw-free graphs
On \(s\)-Hamiltonian line graphs of claw-free graphs
Spanning trails in a 2-connected graph
The local structure of claw-free graphs without induced generalized bulls
Equivalence of Jackson's and Thomassen's conjectures
Hamiltonian claw-free graphs with locally disconnected vertices
Circumferences of 3-connected claw-free graphs. II.
On line graphs of subcubic triangle-free graphs
Hamiltonian paths in spanning subgraphs of line graphs
Cycles through all finite vertex sets in infinite graphs
Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
Hamiltonian claw-free graphs involving minimum degrees
On the 2-factor index of a graph
Local search algorithms for finding the Hamiltonian completion number of line graphs
Forbidden subgraphs that imply 2-factors
Subpancyclicity of line graphs and degree sums along paths
Hamiltonicity in 3-connected claw-free graphs
Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
On spanning disjoint paths in line graphs
Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Supereulerian graphs with constraints on the matching number and minimum degree
A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
Polynomially determining spanning connectivity of locally connected line graphs
Circumferences of 3-connected claw-free graphs
On computing the Hamiltonian index of graphs
On factors of 4-connected 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)