A decomposition method on solving the linear arboricity conjecture
From MaRDI portal
Publication:6143389
DOI10.1002/JGT.23040OpenAlexW4387448334MaRDI QIDQ6143389FDOQ6143389
Authors: Guantao Chen, Yanli Hao 
Publication date: 24 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.23040
Recommendations
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The extremal function for complete minors
- The extremal function for \(K_{9}\) minors
- Homomorphiesätze für Graphen
- On the degrees of the vertices of a directed graph
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Contractions to k8
- Title not available (Why is that?)
- The linear arboricity of graphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering and packing in graphs IV: Linear arboricity
- Linear arboricity of random regular graphs
- Title not available (Why is that?)
- Towards the linear arboricity conjecture
- An improved bound for the linear arboricity conjecture
- The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
- Linear arboricity of degenerate graphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
This page was built for publication: A decomposition method on solving the linear arboricity conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143389)
