Decompositions of a complete multidigraph into nonhamiltonian paths
From MaRDI portal
Publication:3376691
DOI10.1002/JGT.20122zbMATH Open1084.05054OpenAlexW4231038448MaRDI QIDQ3376691FDOQ3376691
Authors: Mariusz Meszka, Zdzisław Skupień
Publication date: 24 March 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20122
Recommendations
Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
- Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a well-spread halving of directed multigraphs.
- Decompositions of a complete multidigraph into almost arbitrary paths
- Title not available (Why is that?)
- Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
- Nomadic decompositions of bidirected complete graphs
This page was built for publication: Decompositions of a complete multidigraph into nonhamiltonian paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376691)