The linear arboricity of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3957129 (Why is no real title available?)
- scientific article; zbMATH DE number 3989394 (Why is no real title available?)
- scientific article; zbMATH DE number 3714952 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 3777548 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- COVERING AND PACKING IN GRAPHS, I.
- Covering and packing in graphs IV: Linear arboricity
- Graph theory with applications
- La k-Arboricité Linéaire Des Arbres
- Linear arboricity of digraphs
- On linear k-arboricity
- Some problems about linear arboricity
- Some results on linear arboricity
- The linear arboricity of some regular graphs
- The star arboricity of graphs
- The star-arboricity of the complete regular multipartite graphs
Cited in
(77)- Linear \(k\)-arboricities on trees
- An algorithmic approach to the Lovász local lemma. I
- scientific article; zbMATH DE number 3957129 (Why is no real title available?)
- Minimum number of disjoint linear forests covering a planar graph
- Trees, Paths, Stars, Caterpillars and Spiders
- Bounded transversals in multipartite graphs
- Path decompositions of tournaments
- On the linear arboricity of graphs with treewidth at most four
- The strong chromatic number of a graph
- A decomposition method on solving the linear arboricity conjecture
- Note on linear arboricity of graphs with large girth
- Constructing graphs with no independent transversals
- scientific article; zbMATH DE number 4101233 (Why is no real title available?)
- Partitioning edges of a planar graph into linear forests and a matching
- Almost Every Graph can be Covered by Linear Forests
- On the linear arboricity of graphs embeddable in surfaces
- Entropy compression versus Lovász local lemma
- Reliable communication over highly connected noisy networks
- scientific article; zbMATH DE number 4085704 (Why is no real title available?)
- Graphs of low average degree without independent transversals
- Colorings, transversals, and local sparsity
- Independent transversals in locally sparse graphs
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Polynomial treewidth forces a large grid-like-minor
- Finding occurrences of protein complexes in protein-protein interaction graphs
- Path decompositions of tournaments
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
- scientific article; zbMATH DE number 1123795 (Why is no real title available?)
- Inapproximability of maximal strip recovery
- scientific article; zbMATH DE number 7274103 (Why is no real title available?)
- On the path partition number of 6‐regular graphs
- Problems and results in extremal combinatorics. I.
- scientific article; zbMATH DE number 5844212 (Why is no real title available?)
- scientific article; zbMATH DE number 5846193 (Why is no real title available?)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Packing list‐colorings
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- Towards the linear arboricity conjecture
- An asymptotic bound for the strong chromatic number
- On graph thickness, geometric thickness, and separator theorems
- Partitioning into graphs with only small components
- Probabilistic methods in coloring and decomposition problems
- Acyclic edge-colorings of sparse graphs
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
- The list linear arboricity of graphs
- An average degree condition for independent transversals
- Hamilton cycles in pseudorandom graphs
- The star arboricity of graphs
- scientific article; zbMATH DE number 6889807 (Why is no real title available?)
- Trees, paths, stars, caterpillars and spiders
- Bounds for the vertex linear arboricity
- Complete subgraphs in a multipartite graph
- Linear arboricity of degenerate graphs
- scientific article; zbMATH DE number 7108969 (Why is no real title available?)
- The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
- scientific article; zbMATH DE number 566421 (Why is no real title available?)
- scientific article; zbMATH DE number 7071489 (Why is no real title available?)
- The linear arboricity of composition graphs
- Linear k-arboricity of Caylay graphs on abelian groups with given degree
- Graph factors and factorization: 1985--2003: a survey
- Fair representation by independent sets
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Linear arboricity of random regular graphs
- An improved bound for the linear arboricity conjecture
- If \((A+A)/(A+A)\) is small, then the ratio set is large
- The linear arboricity of \(K_5\)-minor free graphs
- An introduction to the discharging method via graph coloring
- An efficient case for computing minimum linear arboricity with small maximum degree
- Upper bound for linear arboricity
- Acyclic coloring of graphs
- A parallel algorithmic version of the local lemma
- Recognizing d-interval graphs and d-track interval graphs
- Incidence coloring of Cartesian product graphs
- Finding independent transversals efficiently
- Fair splittings by independent sets in sparse graphs
- A note on the arboricity of graphs
- Factorisation of regular graphs into forests of short paths
This page was built for publication: The linear arboricity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120581)
