An intermediate value theorem for the arboricities
From MaRDI portal
Publication:554848
DOI10.1155/2011/947151zbMath1237.05160OpenAlexW2069576528WikidataQ58687994 ScholiaQ58687994MaRDI QIDQ554848
Narong Punnim, Avapa Chantasartrassmee
Publication date: 22 July 2011
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/947151
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with forbidden subgraphs
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- The Point-Arboricity of Planar Graphs
- COVERING AND PACKING IN GRAPHS, I.
- Decomposition of Finite Graphs Into Forests
- Some Theorems on Abstract Graphs
This page was built for publication: An intermediate value theorem for the arboricities
