Premium
Maximum packings of the complete graph with uniform length cycles
Author(s) -
Horsley Daniel
Publication year - 2011
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20536
Subject(s) - combinatorics , mathematics , pairwise comparison , graph , disjoint sets , discrete mathematics , statistics
In this paper we find the maximum number of pairwise edge‐disjoint m ‐cycles which exist in a complete graph with n vertices, for all values of n and m with 3≤ m ≤ n . © 2010 Wiley Periodicals, Inc. J Graph Theory 68:1‐7, 2011
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom