An intermediate value theorem for the arboricities
DOI10.1155/2011/947151zbMATH Open1237.05160DBLPjournals/ijmmsc/ChantasartrassmeeP11OpenAlexW2069576528WikidataQ58687994 ScholiaQ58687994MaRDI QIDQ554848FDOQ554848
Authors: Avapa Chantasartrassmee, N. Punnim
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
Recommendations
- scientific article; zbMATH DE number 4023311
- scientific article; zbMATH DE number 933181
- A fixed-point theorem for trees
- Ambarzumian's theorem for trees
- Some results on linear arboricity
- scientific article; zbMATH DE number 4177078
- On a problem of linear arboricity
- A note on disjoint arborescences
- Towards the linear arboricity conjecture
Trees (05C05) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The Point-Arboricity of Planar Graphs
- Decomposition of Finite Graphs Into Forests
- Some Theorems on Abstract Graphs
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- COVERING AND PACKING IN GRAPHS, I.
- Title not available (Why is that?)
- Graphs with forbidden subgraphs
Cited In (3)
This page was built for publication: An intermediate value theorem for the arboricities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554848)