On Eulerian and Hamiltonian Graphs and Line Graphs

Cited in

(only showing first 100 items - show all)

On the Hamiltonian index
On hamiltonian line graphs
The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
Local search algorithms for finding the Hamiltonian completion number of line graphs
On 1-Hamilton-connected claw-free graphs
Supereulerian graphs: A survey
On k-edge-Hamilton-connected line graphs
On line graphs and the Hamiltonian index
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
Extending perfect matchings to Hamiltonian cycles in line graphs
The Hamiltonian index of a graph and its branch-bonds
On the connectedness of 3-line graphs
The supereulerian graphs in the graph family \(C(l,k)\)
Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
On the hamiltonian index of a graph
HamiltonianN2-locally connected claw-free graphs
A simple upper bound for the hamiltonian index of a graph
Hamiltonicity of claw-free graphs and Fan-type conditions
On the 2-factor index of a graph
Circumferences of 3-connected claw-free graphs
How many conjectures can you stand? A survey
On the dominating (induced) cycles of iterated line graphs
On computing the Hamiltonian index of graphs
Multigraphic degree sequences and Hamiltonian-connected line graphs
On pancyclic line graphs
Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
Spanning trails
Hamiltonian line graphs
A condition on Hamilton-connected line graphs
On s-fully cycle extendable line graphs
On 2-factors with long cycles in 3-connected claw-free graphs
On \(s\)-Hamiltonian-connected line graphs
The local structure of claw-free graphs without induced generalized bulls
Graphs with the unique path property: Structure, cycles, factors, and constructions
Hamilton cycles in 6-connected claw-free graphs (extended abstract)
A note on minimum degree conditions for supereulerian graphs
On the line graph of a graph with diameter 2
Catlin's reduced graphs with small orders
Hamiltonicity of 6-connected line graphs
Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
Ein Struktursatz für 2-fach zusammenhängende Graphen mit großer Minimalvalenz
On spanning tree packings of highly edge connected graphs
Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
s-vertex pancyclic index
DNA origami and the complexity of Eulerian circuits with turning costs
On traceable iterated line graph and Hamiltonian path index
Degree sequence and supereulerian graphs
Hamilton connectivity of line graphs and claw‐free graphs
Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
Edge degree conditions for dominating and spanning closed trails
Hamilton circuits and essential girth of claw free graphs
scientific article; zbMATH DE number 7021376 (Why is no real title available?)
On s-Hamiltonicity of net-free line graphs
Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
Pairs of forbidden subgraphs and 2-connected supereulerian graphs
Traversability and connectivity of the middle graph of a graph
Circumferences and minimum degrees in 3-connected claw-free graphs
On 3-connected Hamiltonian line graphs
Hamiltonian line graphs with local degree conditions
The hamiltonian index of a 2-connected graph
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
Cycles through all finite vertex sets in infinite graphs
Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
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
On dominating and spanning circuits in graphs
Existence of spanning and dominating trails and circuits
A result on Hamiltonian line graphs involving restrictions on induced subgraphs
On eulerian subgraphs of complementary graphs
Minimum number of components of 2-factors in iterated line graphs
A note on edge-disjoint Hamilton cycles in line graphs
Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles
Hamiltonian cycles in spanning subgraphs of line graphs
k-ordered hamiltonicity of iterated line graphs
On Hamiltonicity of 2-connected claw-free graphs
Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
Radius and subpancyclicity in line graphs
A closure for 1-Hamilton-connectedness in claw-free graphs
Hamilton cycles in 5-connected line graphs
Exact algorithms for finding longest cycles in claw-free graphs
A note on collapsible graphs and super-Eulerian graphs
On s-Hamiltonian line graphs
Hamiltonicity of complements of middle graphs
Hamiltonicity and forbidden subgraphs in 4‐connected graphs
On n-hamiltonian line graphs
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
Closure, stability and iterated line graphs with a 2-factor
On Hamiltonicity of 3-connected claw-free graphs
On the s-hamiltonianicity of an hourglass-free line graph
Some algebraic properties of the subdivision graph of a graph
Hamiltonian index is NP-complete
Thomassen's conjecture for line graphs of 3-hypergraphs
On the hamiltonian index and the radius of a graph
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
Hamilton‐connected {claw, bull}‐free graphs
Hamilton‐connected {claw, net}‐free graphs, I
Supereulerian graphs with constraints on the matching number and minimum degree
Polynomially determining spanning connectivity of locally connected line 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)