Two-factorizations of small complete graphs
From MaRDI portal
Publication:1569867
DOI10.1016/S0378-3758(99)00123-8zbMath0956.05081WikidataQ114120968 ScholiaQ114120968MaRDI QIDQ1569867
Alexander Rosa, Frantisek Franek
Publication date: 9 July 2000
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, On the generalized Oberwolfach problem, On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, Scheduling sports tournaments on a single court minimizing waiting times, Combinatorial properties of strength groups in round robin tournaments, Complete solutions to the Oberwolfach problem for an infinite set of orders, On a generalization of the Oberwolfach problem, The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors, Primitive 2-factorizations of the complete graph, Hamilton cycle rich 2-factorizations of complete multipartite graphs, On bipartite 2-factorizations of kn − I and the Oberwolfach problem, On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
Cites Work
