Degree sequences and graphs with disjoint spanning trees
From MaRDI portal
Publication:642969
DOI10.1016/J.DAM.2011.05.009zbMATH Open1231.05076OpenAlexW2158029977MaRDI QIDQ642969FDOQ642969
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
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
- Graph theory
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A remark on the existence of finite graphs
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- Title not available (Why is that?)
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Degree conditions for group connectivity
- Reinforcing the number of disjoint spanning trees
- Optimal attack and reinforcement of a network
- Degree sequence and supereulerian graphs
- Line removal algorithms for graphs and their degree lists
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- A remark on degree sequences of multigraphs
Cited In (8)
- A new bound of radius with irregularity index
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
- On constructing rational spanning tree edge densities
- Title not available (Why is that?)
- Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
- Sequences of spanning trees and a fixed tree theorem
- 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)
