The following pages link to The linear arboricity of graphs (Q1120581):
Displaying 50 items.
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Upper bound for linear arboricity (Q809087) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- A note on the arboricity of graphs (Q1205341) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- Factorisation of regular graphs into forests of short paths (Q1584284) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- The star arboricity of graphs (Q1825208) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- Reliable communication over highly connected noisy networks (Q2010609) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree (Q2071534) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- Incidence coloring of Cartesian product graphs (Q2348706) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- An average degree condition for independent transversals (Q2668023) (← links)
- If (<i>A</i>+<i>A</i>)/(<i>A</i>+<i>A</i>) is small, then the ratio set is large (Q2793760) (← links)
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes (Q2833255) (← links)
- A Planar linear arboricity conjecture (Q2891050) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← links)
- Trees, Paths, Stars, Caterpillars and Spiders (Q3467870) (← links)
- Acyclic coloring of graphs (Q3977081) (← links)
- An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)
- A parallel algorithmic version of the local lemma (Q3986106) (← links)
- The strong chromatic number of a graph (Q3989737) (← links)
- Note on linear arboricity of graphs with large girth (Q4005688) (← links)
- (Q4291534) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- Almost Every Graph can be Covered by Linear Forests (Q4862746) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Complete subgraphs in a multipartite graph (Q5886355) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Planar projections of graphs (Q5896110) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
