✦ LIBER ✦

Covering the complete graph with plane cycles

✍ Scribed by Alan Hartman; Yoav Medan

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 373 KB
Volume: 44
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90239-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering a graph with cycles

✍ Hong Wang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract Let __k__ and __n__ be two integers such that __k__ ≥ 0 and __n__ ≥ 3(__k__ + 1). Let __G__ be a graph of order __n__ with minimum degree at least ⌈(__n__ + __k__)/2⌉. Then __G__ contains __k__ + 1 independent cycles covering all the vertices of __G__ such that __k__ of them are triangl

Covering the complete graph by partition

Covering the complete graph by partitions

✍ Zoltán Füredi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 530 KB

A (D, c)-coloring of the complete graph K" is a coloring of the edges with c colors such that all monochromatic connected subgraphs have at most D vertices. Resolvable block designs with c parallel classes and with block size D are natural examples of (D, c)-colorings. However, (D, c)-colorings are

Covering a graph with cycles passing thr

Covering a graph with cycles passing through given edges

✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 2 views

We propose a conjecture: for each integer k ≥ 2, there exists N (k) such that if G is a graph of order n ≥ N (k) and d(x) + d(y) ≥ n + 2k -2 for each pair of nonadjacent vertices x and y of G, then for any k independent edges e 1 , . . . , e k of G, there exist If this conjecture is true, the condi

Maximum packings of the complete graph w

Maximum packings of the complete graph with uniform length cycles

✍ Daniel Horsley 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≤ m ≤ n.

Recognizing triangle-free graphs with in

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete

✍ Jacobson, Michael S.; K�zdy, Andr� E.; Lehel, Jen? 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 2 views

An induced path-cycle double cover (IPCDC) of a simple graph G is a family F Å {F 1 , . . . , F k } of induced paths and cycles of G such that if F i ʝ F j x M, then F i ʝ F j is a vertex or an edge, for i x j, each edge of G appears in precisely two of the F i 's, and each vertex of G appears in pr

Euler cycles in the complete graph K2m+1

✍ Tomáš Dvořák; Ivan Havel; Petr Liebl 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 661 KB

We analyze the freedom one has when walking along an Euler cycle through a complete graph of an odd order: Is it possible, for any cycle C of (2~+1) vertices, 2m + 1 of them being black, to find an edge monomorphism of C onto K2m+~, that would be injective on the set of black vertices of C? It is sh