601:
366:
168:
541:
274:
201:
506:
440:
393:
460:
413:
334:
314:
294:
241:
221:
136:
116:
582:
642:
21:
71:
and
Heather Gavlas established necessary and sufficient conditions for the existence of a decomposition of a
616:
666:
635:
339:
141:
511:
661:
246:
173:
83:) into even cycles and a complete graph of odd order into odd cycles. Their proof relies on
484:
418:
371:
40:
8:
628:
76:
445:
398:
319:
299:
279:
226:
206:
121:
101:
36:
578:
554:
80:
88:
43:. Every vertex in a graph that has a cycle decomposition must have even degree.
612:
72:
655:
68:
608:
559:
480:
84:
28:
92:
17:
573:
Bondy, J.A.; Murty, U.S.R. (2008), "2.4 Decompositions and coverings",
91:, and many of their decompositions come from the action of a
600:
223:
is a 1-factor) can be decomposed into cycles of length
46:
514:
487:
448:
421:
401:
374:
342:
322:
302:
282:
249:
229:
209:
176:
144:
124:
104:
535:
500:
454:
434:
407:
387:
360:
328:
308:
288:
268:
235:
215:
195:
162:
130:
110:
653:
636:
98:They proved that for positive even integers
643:
629:
572:
558:
547:Journal of Combinatorial Theory, Series B
395:can be decomposed into cycles of length
478:
654:
415:if and only if the number of edges in
243:if and only if the number of edges in
595:
13:
296:. Also, for positive odd integers
22:Cycle decomposition (group theory)
14:
678:
16:For the notation used to express
599:
472:
1:
465:
361:{\displaystyle 3\leq m\leq n}
163:{\displaystyle 4\leq m\leq n}
615:. You can help Knowledge by
7:
10:
683:
594:
15:
536:{\displaystyle K_{n}{-}I}
481:"Cycle Decompositions of
39:of a graph's edges) into
479:Alspach, Brian (2001).
269:{\displaystyle K_{n}-I}
196:{\displaystyle K_{n}-I}
47:Cycle decomposition of
611:-related article is a
560:10.1006/jctb.2000.1996
537:
502:
456:
436:
409:
389:
362:
330:
310:
290:
270:
237:
217:
197:
164:
132:
112:
75:of even order minus a
35:is a decomposition (a
538:
503:
501:{\displaystyle K_{n}}
457:
437:
435:{\displaystyle K_{n}}
410:
390:
388:{\displaystyle K_{n}}
363:
331:
311:
291:
271:
238:
218:
198:
165:
133:
113:
95:on a fixed subgraph.
512:
485:
446:
419:
399:
372:
340:
320:
300:
280:
247:
227:
207:
174:
142:
122:
102:
33:cycle decomposition
667:Graph theory stubs
533:
498:
452:
432:
405:
385:
358:
326:
306:
286:
266:
233:
213:
193:
160:
128:
108:
624:
623:
584:978-1-84628-969-9
455:{\displaystyle m}
442:is a multiple of
408:{\displaystyle m}
329:{\displaystyle n}
309:{\displaystyle m}
289:{\displaystyle m}
276:is a multiple of
236:{\displaystyle m}
216:{\displaystyle I}
131:{\displaystyle n}
111:{\displaystyle m}
87:, in particular,
674:
645:
638:
631:
603:
596:
587:
565:
564:
562:
542:
540:
539:
534:
529:
524:
523:
507:
505:
504:
499:
497:
496:
476:
461:
459:
458:
453:
441:
439:
438:
433:
431:
430:
414:
412:
411:
406:
394:
392:
391:
386:
384:
383:
367:
365:
364:
359:
335:
333:
332:
327:
315:
313:
312:
307:
295:
293:
292:
287:
275:
273:
272:
267:
259:
258:
242:
240:
239:
234:
222:
220:
219:
214:
202:
200:
199:
194:
186:
185:
169:
167:
166:
161:
137:
135:
134:
129:
117:
115:
114:
109:
89:circulant graphs
81:perfect matching
682:
681:
677:
676:
675:
673:
672:
671:
652:
651:
650:
649:
592:
585:
569:
568:
525:
519:
515:
513:
510:
509:
492:
488:
486:
483:
482:
477:
473:
468:
447:
444:
443:
426:
422:
420:
417:
416:
400:
397:
396:
379:
375:
373:
370:
369:
341:
338:
337:
321:
318:
317:
301:
298:
297:
281:
278:
277:
254:
250:
248:
245:
244:
228:
225:
224:
208:
205:
204:
181:
177:
175:
172:
171:
143:
140:
139:
123:
120:
119:
103:
100:
99:
66:
59:
52:
25:
12:
11:
5:
680:
670:
669:
664:
648:
647:
640:
633:
625:
622:
621:
604:
590:
589:
583:
567:
566:
532:
528:
522:
518:
495:
491:
470:
469:
467:
464:
451:
429:
425:
404:
382:
378:
357:
354:
351:
348:
345:
325:
305:
285:
265:
262:
257:
253:
232:
212:
192:
189:
184:
180:
159:
156:
153:
150:
147:
127:
107:
73:complete graph
65:
57:
50:
45:
9:
6:
4:
3:
2:
679:
668:
665:
663:
660:
659:
657:
646:
641:
639:
634:
632:
627:
626:
620:
618:
614:
610:
605:
602:
598:
597:
593:
586:
580:
576:
571:
570:
561:
556:
552:
548:
544:
530:
526:
520:
516:
493:
489:
475:
471:
463:
449:
427:
423:
402:
380:
376:
355:
352:
349:
346:
343:
323:
303:
283:
263:
260:
255:
251:
230:
210:
190:
187:
182:
178:
157:
154:
151:
148:
145:
125:
105:
96:
94:
90:
86:
85:Cayley graphs
82:
78:
74:
70:
69:Brian Alspach
64:
60:
53:
44:
42:
38:
34:
30:
23:
19:
662:Graph theory
617:expanding it
609:graph theory
606:
591:
577:, Springer,
575:Graph Theory
574:
550:
546:
474:
368:, the graph
170:, the graph
97:
67:
62:
55:
48:
37:partitioning
32:
29:graph theory
26:
18:permutations
93:permutation
656:Categories
466:References
553:: 77–99.
527:−
353:≤
347:≤
261:−
188:−
155:≤
149:≤
543: "
77:1-factor
203:(where
581:
41:cycles
20:, see
607:This
336:with
138:with
613:stub
579:ISBN
508:and
316:and
118:and
54:and
31:, a
555:doi
79:(a
27:In
658::
551:81
549:.
545:.
462:.
61:−
644:e
637:t
630:v
619:.
588:.
563:.
557::
531:I
521:n
517:K
494:n
490:K
450:m
428:n
424:K
403:m
381:n
377:K
356:n
350:m
344:3
324:n
304:m
284:m
264:I
256:n
252:K
231:m
211:I
191:I
183:n
179:K
158:n
152:m
146:4
126:n
106:m
63:I
58:n
56:K
51:n
49:K
24:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
