✦ LIBER ✦

On the size of graphs with all cycle having distinct length

✍ Scribed by Chunhui Lai

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 88 KB
Volume: 122
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90311-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs in which all Hamiltonian cycles h

Graphs in which all Hamiltonian cycles have the same length

✍ Stanisław Kryński 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Bipartite graphs with cycles of all even

Bipartite graphs with cycles of all even lengths

✍ Edward Schmeichel; John Mitchem 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB 👁 1 views

## Abstract Let __G__ = (__X, Y, E__) be a bipartite graph with __X__ = __Y__ = __n__. Chvátal gave a condition on the vertex degrees of __X__ and __Y__ which implies that __G__ contains a Hamiltonian cycle. It is proved here that this condition also implies that __G__ contains cycles of every even

On the distribution of cycle lengths in

On the distribution of cycle lengths in graphs

✍ A. Gyárfás; J. Komlós; E. Szemerédi 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 843 KB

The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdos and Hajnal stating that for suit

Cycle Lengths in Hamiltonian Graphs with

Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum

✍ Michael Ferrara; Michael S. Jacobson; Angela Harris 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 190 KB

On the length of longest dominating cycl

On the length of longest dominating cycles in graphs

✍ Hoa Vu Dinh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length

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.