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