Common multiples of complete graphs and a 4-cycle

Adams, P, Bryant, D and Maenhaut, B (2004) Common multiples of complete graphs and a 4-cycle. Discrete Mathematics, 275 1-3: 289-297. doi:10.1016/j.disc.2002.11.001


Author Adams, P
Bryant, D
Maenhaut, B
Title Common multiples of complete graphs and a 4-cycle
Journal name Discrete Mathematics   Check publisher's open access policy
ISSN 0012-365X
Publication date 2004-01-01
Sub-type Article (original research)
DOI 10.1016/j.disc.2002.11.001
Volume 275
Issue 1-3
Start page 289
End page 297
Total pages 9
Editor P.L. Hammer
Place of publication Netherlands
Publisher Elsevier BV, North-Holland
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
Abstract A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.
Keyword Graph Decomposition
Cycle Decomposition
Graph Design
Cycle System
Sizes
Mathematics
Q-Index Code C1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 12:58:32 EST