Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
From MaRDI portal
Publication:4805225
Recommendations
- Eulerian subgraphs and Hamilton-connected line graphs
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- scientific article; zbMATH DE number 21754
- On 3-connected Hamiltonian line graphs
- Eulerian subgraphs and \(S\)-connectivity of graphs
- Eulerian subgraphs containing given edges
- Hamiltonian connectedness in 3-connected line graphs
- Hamiltonicity of 3-connected line graphs
- Eulerian subgraphs containing given vertices
- Hamiltonian cycles in spanning subgraphs of line graphs
Cited in
(19)- Circumferences and minimum degrees in 3-connected claw-free graphs
- Hamiltonian line graphs with local degree conditions
- Lai's conditions for spanning and dominating closed trails
- Eulerian subgraphs containing given vertices
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- A twelve vertex theorem for 3-connected claw-free graphs
- Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
- Spanning trails in a 2-connected graph
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Circumferences of 2-factors in claw-free graphs
- Supereulerian graphs and the Petersen graph
- Circumferences of 3-connected claw-free graphs. II.
- scientific article; zbMATH DE number 21754 (Why is no real title available?)
- Hamiltonicity in 3-connected claw-free graphs
- On 2-factors with long cycles in 3-connected claw-free graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Circumferences of 3-connected claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
This page was built for publication: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805225)
