Can I read The smallest degree sum that yields potentially kCl-graphic sequences on EtoBox?

The smallest degree sum that yields potentially kCl-graphic sequences by Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen is a Computer Science article available to read on EtoBox.

What is The smallest degree sum that yields potentially kCl-graphic sequences about?

considered a variation of the classical Turà an-type extremal problems as follows: For a given graph H , determine the smallest even integer (H; n) such that every n-term graphic sequence = (d1; d2; : : : ; dn) with term sum ( ) = d1 + d2 + • • • + dn ¿ (H; n) has a realization G containing H as a subgraph. In this paper, for given integers k and ', ' ¿ 7 and 3 6 k 6 ', we completely determine the smallest even integer ( k C ' ; n) such that each n-term graphic sequence = (d1; d2; : : : ; dn) with term sum ( ) = d1 + d2 + • • • + dn ¿ ( k C ' ; n) has a realization G containing a cycle of length r for each r, k 6 r 6 '.

Who reads The smallest degree sum that yields potentially kCl-graphic sequences?

Author

Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)

Published

2003

Language

EN

Field

Computer Science (Physical Sciences)