Publication:4873803
From MaRDI portal
zbMath0841.05067MaRDI QIDQ4873803
Publication date: 21 April 1996
edge-disjoint spanning trees; Hamiltonian line graph; spanning trail; edge cut; spanning Eulerian subgraph
Related Items
On \(s\)-Hamiltonian-connected line graphs, Edge-connectivity and edge-disjoint spanning trees, Hamiltonian connectedness in 3-connected line graphs, Graphs without spanning closed trails, Packing spanning trees in highly essentially connected graphs, Degree sum and Hamiltonian-connected line graphs, Every 3-connected essentially 10-connected line graph is Hamilton-connected, Spanning tree packing and 2-essential edge-connectivity, Complete family reduction and spanning connectivity in line graphs, A condition on Hamilton-connected line graphs, Chvátal-Erdős conditions and almost spanning trails, Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors, On spanning disjoint paths in line graphs