Decompositions of 6-regular bipartite graphs into paths of length six
From MaRDI portal
Publication:2657084
Recommendations
Cites work
- Decomposing 8-regular graphs into paths of length 4
- Decomposing regular graphs with prescribed girth into paths of given length
- Decompositions of regular bipartite graphs
- Decompositions of triangle-free 5-regular graphs into paths of length five
- From the theory of regular graphs of third and fourth degree
- scientific article; zbMATH DE number 4150219 (Why is no real title available?)
- scientific article; zbMATH DE number 3948320 (Why is no real title available?)
- scientific article; zbMATH DE number 1334640 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- On path decompositions of \(2 k\)-regular graphs
- Regular path decompositions of odd regular graphs
Cited in
(7)- On path decompositions of 2k-regular graphs
- scientific article; zbMATH DE number 1334640 (Why is no real title available?)
- On the path partition number of 6‐regular graphs
- The problem of path decomposition for graphs with treewidth at most 4
- Gallai's conjecture for 3-degenerated graphs
- Transitive path decompositions of Cartesian products of complete graphs
- Gallai's conjecture on certain families of bipartite graphs
This page was built for publication: Decompositions of 6-regular bipartite graphs into paths of length six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657084)