scientific article; zbMATH DE number 867689

zbMath0841.05067MaRDI QIDQ4873803

Paul A. Catlin, Hong-Jian Lai

Publication date: 21 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

edge-disjoint spanning treesHamiltonian line graphspanning trailedge cutspanning Eulerian subgraph

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Packing spanning trees in highly essentially connected graphs ⋮ On spanning disjoint paths in line graphs ⋮ Graphs without spanning closed trails ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ On \(s\)-Hamiltonian-connected line graphs ⋮ Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors ⋮ Every 3-connected essentially 10-connected line graph is Hamilton-connected ⋮ Edge-connectivity and edge-disjoint spanning trees ⋮ Hamiltonian connectedness in 3-connected line graphs ⋮ Spanning tree packing and 2-essential edge-connectivity ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ A condition on Hamilton-connected line graphs

This page was built for publication: