On spanning disjoint paths in line graphs

DOI10.1007/s00373-012-1237-0zbMath1290.05094OpenAlexW2094960866MaRDI QIDQ2637723

Ye Chen, Er-ling Wei, Ping Li, Hong-Jian Lai, Zhi-Hong Chen

Publication date: 14 February 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1237-0

zbMATH Keywords

connectivitysupereulerian graphsspanning connectivitycollapsible graphsHamiltonian linegraphHamiltonian-connected line graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (7)

Packing spanning trees in highly essentially connected graphs ⋮ Supereulerian width of dense graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Spanning 3-connected index of graphs ⋮ Generalizations of the classics to spanning connectedness ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The spanning connectivity of line graphs
• Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
• Graphs without spanning closed trails
• On cycle double covers of line graphs
• Advances on the Hamiltonian problem -- a survey
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Polyhedral decompositions of cubic graphs
• On the Imbedding of Linear Graphs in Surfaces
• Nowhere zero flows in line graphs

This page was built for publication: On spanning disjoint paths in line graphs