Degree sequences and graphs with disjoint spanning trees

DOI10.1016/j.dam.2011.05.009zbMath1231.05076OpenAlexW2158029977MaRDI QIDQ642969

Hong-Jian Lai, Yanting Liang, Ping Li, Jin-Quan Xu

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.009

zbMATH Keywords

strengthfractional arboricity\(k\) edge-disjoint spanning treesgraphic degree sequence

Mathematics Subject Classification ID

Trees (05C05) Mathematical problems of computer architecture (68M07) Vertex degrees (05C07)

Related Items

On constructing rational spanning tree edge densities ⋮ A new bound of radius with irregularity index ⋮ Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees ⋮ Degree sequence realizations with given packing and covering of spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Degree conditions for group connectivity
• Degree sequence and supereulerian graphs
• A remark on degree sequences of multigraphs
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• A remark on the existence of finite graphs
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• Optimal attack and reinforcement of a network
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Line removal algorithms for graphs and their degree lists