Packing paths in complete graphs
type: Item
instance of: scholarly article
title: Packing paths in complete graphs
zbMATH Open document ID: 1216.05111
published in: Journal of Combinatorial Theory. Series B
publication date: 2010-04-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5696989
zbMATH Keywords: path decompositions
zbMATH Keywords: graph decompositions
zbMATH Keywords: graph packing
author: Darryn Bryant
MaRDI profile type: Publication
full work available at URL: j.jctb.2009.08.004
OpenAlex ID: W2000090320
cites work: A survey on the existence ofG-Designs
cites work: Q3514485
cites work: Embedding Partial Steiner Triple Systems
cites work: Q5421810
cites work: Packing cycles in complete graphs
cites work: Decompositions of complete graphs into long cycles
cites work: Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
cites work: Solution of fink & straight conjecture on path-perfect complete bipartite graphs
cites work: A proof of the two-path conjecture
cites work: Q4288120
cites work: Graph decompositions, handcuffed prisoners and balanced p-designs
cites work: Handcuffed designs
cites work: On the construction of handcuffed designs
cites work: Further results concerning the existence of handcuffed designs
cites work: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs
cites work: Decompositions of highly connected graphs into paths of length 3
DOI: 10.1016/J.JCTB.2009.08.004
description: scientific article; zbMATH DE number 5696989