Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
DOI10.1007/S00373-014-1442-0zbMATH Open1327.05282OpenAlexW1977407093MaRDI QIDQ497372FDOQ497372
Authors: Tay-Woei Shyu 
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1442-0
Recommendations
- Decomposition of complete bipartite graphs into paths and cycles
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- scientific article; zbMATH DE number 5139445
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory with applications
- Property testing and its connection to learning and approximation
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Decomposition of the complete directed graph into k-circuits
- Decompositions of a complete multidigraph into nonhamiltonian paths
Cited In (12)
- Decomposition of \(K_n\) into circuits of odd length
- Decomposition of complete bipartite graphs into paths and cycles
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Title not available (Why is that?)
- Decompositions of nearly complete digraphs into \(t\) isomorphic parts
- Decompositions of a complete multidigraph into almost arbitrary paths
- Title not available (Why is that?)
- On the spectra of bipartite directed subgraphs of \(K^\ast_4\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Partitioning oriented 2-paths
This page was built for publication: Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497372)
