Degree sequences and graphs with disjoint spanning trees

DOI10.1016/J.DAM.2011.05.009zbMATHOpenAlexMaRDI QIDQ642969FDO

Authors Hong-Jian Lai, Yanting Liang, Ping Li, Jinquan 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

fractional arboricitystrength\(k\) edge-disjoint spanning treesgraphic degree sequence

Mathematics Subject Classification ID

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

Recommendations

• Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
• scientific article; zbMATH DE number 3873374
• The number of spanning trees in graphs with a given degree sequence
• Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
• A note on spanning trees with a specified degree sequence
• scientific article; zbMATH DE number 713480
• Degree sequences in graphs
• scientific article; zbMATH DE number 903055
• Sequences of spanning trees and a fixed tree theorem

Cites work

• scientific article; zbMATH DE number 713480 (Why is no real title available?)
• A remark on degree sequences of multigraphs
• A remark on the existence of finite graphs
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Degree conditions for group connectivity
• Degree sequence and supereulerian graphs
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Graph theory
• Line removal algorithms for graphs and their degree lists
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Optimal attack and reinforcement of a network
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• Reinforcing the number of disjoint spanning trees

Cited in

(11)

• Sequences of spanning trees and a fixed tree theorem
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
• Multigraphic degree sequences and Hamiltonian-connected line graphs
• Packing tree degree sequences
• On constructing rational spanning tree edge densities
• scientific article; zbMATH DE number 903055 (Why is no real title available?)
• A new bound of radius with irregularity index
• Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
• Edge disjoint caterpillar realizations
• Degree sequence realizations with given packing and covering of spanning trees

This page was built for publication: Degree sequences and graphs with disjoint spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642969)