Path decompositions of oriented graphs
From MaRDI portal
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- An improved bound for the linear arboricity conjecture
- An upper bound on the path number of a digraph
- Approximate path decompositions of regular graphs
- Cycle packing
- Decomposing tournaments into paths
- From the theory of regular graphs of third and fourth degree
- Gallai's conjecture for disconnected graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- Linear arboricity of digraphs
- Linear arboricity of regular digraphs
- Long cycles, heavy cycles and cycle decompositions in digraphs
- Minimum path decompositions of oriented cubic graphs
- NP-completeness of some problems of partitioning and covering in graphs
- On a problem of Spencer
- Path decompositions of digraphs
- Path decompositions of tournaments
- Path numbers of tournaments
- Probabilistic methods in coloring and decomposition problems
- Random graphs.
- The linear arboricity of graphs
- The Representation of a Graph by Set Intersections
- Towards the Erdős-Gallai cycle decomposition conjecture
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
This page was built for publication: Path decompositions of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293081)
