A decomposition method on solving the linear arboricity conjecture
From MaRDI portal
Publication:6143389
Recommendations
Cites work
- scientific article; zbMATH DE number 3989394 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- An improved bound for the linear arboricity conjecture
- Contractions to k8
- Covering and packing in graphs IV: Linear arboricity
- Homomorphiesätze für Graphen
- Linear arboricity of degenerate graphs
- Linear arboricity of random regular graphs
- On the degrees of the vertices of a directed graph
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
- The extremal function for \(K_{9}\) minors
- The extremal function for complete minors
- The linear arboricity of graphs
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Towards the linear arboricity conjecture
- \(3n-5\) edges do force a subdivision of \(K_5\)
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)