Path odd-covers of graphs
From MaRDI portal
Cites work
- An Erdős-Gallai conjecture
- An improved bound for the linear arboricity conjecture
- Constructing Clustering Transformations
- Covering and packing in graphs IV: Linear arboricity
- Covers of Eulerian graphs
- Cycle packing
- Decomposition of Finite Graphs Into Forests
- Gallai's conjecture for disconnected graphs
- Gallai's path decomposition conjecture for graphs of small maximum degree
- scientific article; zbMATH DE number 3857112 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- scientific article; zbMATH DE number 3395950 (Why is no real title available?)
- Julius Petersen's theory of regular graphs
- Odd covers of graphs
- On Gallai's conjecture for graphs with maximum degree 6
- On the Addressing Problem for Loop Switching
- On the Assignment Polytope
- On the coverings of graphs
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- On the Shannon capacity of a graph
- Subgraph complementation and minimum rank
- Subgraph coverings and edge switchings
- The linear arboricity of graphs
- The theory of regular graphs
- Towards the Erdős-Gallai cycle decomposition conjecture
- Towards the linear arboricity conjecture
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
This page was built for publication: Path odd-covers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268481)
