Exact coverings of 2-paths by 4-cycles
From MaRDI portal
DOI10.1016/0097-3165(87)90046-XzbMATH Open0675.05044MaRDI QIDQ1121909FDOQ1121909
Authors: Katherine Heinrich, Gillian M. Nonay
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (22)
- A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
- Embedding coverings of 2-paths with 3-paths
- Common multiples of complete graphs and a 4-cycle
- Decomposition of \(K_{m,n}\) into short cycles
- Covering 2-paths uniformly
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Path coverings with paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact coverings of 2-paths by Hamilton cycles
- Multidecompositions of line graphs of complete graphs
- Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
- Maximum packing and minimum covering of the line graph of the complete graph with kite
- Uniform coverings of 2-paths with 4-cycles
- Resolvable coverings of 2-paths by 4-cycles
- A solution of Dudeney's round table problem for an even number of people
- Dudeney's round table problem
- Resolvable coverings of 2-paths by cycles
- Uniform coverings of 2-paths with 5-paths in the complete graph
- Cycle decompositions of the line graph of \(K_ n\)
- Decompositions of line graphs of complete graphs into paths and cycles
- Uniform coverings of 2-paths by 4-paths
This page was built for publication: Exact coverings of 2-paths by 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121909)