On s-Hamiltonian line graphs
From MaRDI portal
On \(s\)-Hamiltonian line graphs
Recommendations
Cites work
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Decomposition of Finite Graphs Into Forests
- Duality in graph families
- Edge-Disjoint Spanning Trees of Finite Graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Graph theory with applications
- Graphs without spanning closed trails
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On hamiltonian line graphs and connectivity
- On the Problem of Decomposing a Graph into n Connected Factors
- Reflections on graph theory
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
Cited in
(16)- A condition on Hamilton-connected line graphs
- On the s-hamiltonianicity of an hourglass-free line graph
- On s-Hamiltonicity of net-free line graphs
- On the line graph of a graph with diameter 2
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Hamiltonian paths in spanning subgraphs of line graphs
- A sufficient condition for s-Hamilton-connected graphs
- New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs
- scientific article; zbMATH DE number 5184446 (Why is no real title available?)
- scientific article; zbMATH DE number 3946175 (Why is no real title available?)
- Hamiltonicity of 4-connected line graph of a planar graph
- On hamiltonian line graphs of hypergraphs
- On \(s\)-Hamiltonian-connected line graphs
- On \(s\)-Hamiltonian-connected line graphs
- The \(s\)-Hamiltonian index
- An s-Hamiltonian line graph problem
This page was built for publication: On \(s\)-Hamiltonian line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862549)