Edge-connectivity and edge-disjoint spanning trees

DOI10.1016/j.disc.2007.11.056zbMath1168.05039OpenAlexW2160500265MaRDI QIDQ1011773

Paul A. Catlin, Yehong Shao, Hong-Jian Lai

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.056

zbMATH Keywords

spanning tree packing numberline graphedge-connectivityspanning arborescences\(k\)-arc-connected digraphs\(s\)-Hamiltonian\(s\)-Hamiltonian-connectedhigher order of edge-connectivityhigher order of edge-toughness

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Packing spanning trees in highly essentially connected graphs, On the \(s\)-hamiltonianicity of an hourglass-free line graph, Strengthened Ore conditions for \((s, t)\)-supereulerian graphs, Tree robustness of a graph, On spanning tree packings of highly edge connected graphs, Edge-decomposition of graphs into copies of a tree with four edges, Graphs with a 3-cycle-2-cover, Completely independent spanning trees in line graphs, Edge-disjoint spanning trees and eigenvalues of regular graphs, Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs, Edge-disjoint Steiner trees and connectors in graphs, Edge-disjoint spanning trees and eigenvalues, On \(( s , t )\)-supereulerian graphs with linear degree bounds, Spanning trees: A survey, Polynomially determine if a graph is \((s,3)\)-supereulerian, Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors, Collapsible subgraphs of a 4-edge-connected graph, The spanning connectivity of line graphs, Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid, Game edge-connectivity of graphs, Edge-connectivity and edge-disjoint spanning trees, Unnamed Item, Spanning tree packing number and eigenvalues of graphs with given girth, On \(s\)-Hamiltonian line graphs of claw-free graphs, A condition on Hamilton-connected line graphs

Cites Work

• On the higher-order edge toughness of a graph
• Edge-connectivity and edge-disjoint spanning trees
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• On n-hamiltonian line graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item