Degree sequence and independence in K(4)-free graphs

P. Erdős, Ralph Faudree, Talmage James Reid, Richard Schelp, William Staton

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We investigate whether Kr-free graphs with few repetitions in the degree sequence may have independence number o(n). We settle the cases r = 3 and r ≥ 5, and give partial results for the very interesting case r = 4.

Original languageEnglish
Pages (from-to)285-290
Number of pages6
JournalDiscrete Mathematics
Volume141
Issue number1-3
DOIs
Publication statusPublished - Jun 28 1995

Fingerprint

Independence number
Degree Sequence
Partial
Graph in graph theory
Repetition
Independence

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Erdős, P., Faudree, R., Reid, T. J., Schelp, R., & Staton, W. (1995). Degree sequence and independence in K(4)-free graphs. Discrete Mathematics, 141(1-3), 285-290. https://doi.org/10.1016/0012-365X(93)E0226-T

Degree sequence and independence in K(4)-free graphs. / Erdős, P.; Faudree, Ralph; Reid, Talmage James; Schelp, Richard; Staton, William.

In: Discrete Mathematics, Vol. 141, No. 1-3, 28.06.1995, p. 285-290.

Research output: Contribution to journalArticle

Erdős, P, Faudree, R, Reid, TJ, Schelp, R & Staton, W 1995, 'Degree sequence and independence in K(4)-free graphs', Discrete Mathematics, vol. 141, no. 1-3, pp. 285-290. https://doi.org/10.1016/0012-365X(93)E0226-T
Erdős, P. ; Faudree, Ralph ; Reid, Talmage James ; Schelp, Richard ; Staton, William. / Degree sequence and independence in K(4)-free graphs. In: Discrete Mathematics. 1995 ; Vol. 141, No. 1-3. pp. 285-290.
@article{f4e9b984b4d94f75b82adc4532c2a56e,
title = "Degree sequence and independence in K(4)-free graphs",
abstract = "We investigate whether Kr-free graphs with few repetitions in the degree sequence may have independence number o(n). We settle the cases r = 3 and r ≥ 5, and give partial results for the very interesting case r = 4.",
author = "P. Erdős and Ralph Faudree and Reid, {Talmage James} and Richard Schelp and William Staton",
year = "1995",
month = "6",
day = "28",
doi = "10.1016/0012-365X(93)E0226-T",
language = "English",
volume = "141",
pages = "285--290",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Degree sequence and independence in K(4)-free graphs

AU - Erdős, P.

AU - Faudree, Ralph

AU - Reid, Talmage James

AU - Schelp, Richard

AU - Staton, William

PY - 1995/6/28

Y1 - 1995/6/28

N2 - We investigate whether Kr-free graphs with few repetitions in the degree sequence may have independence number o(n). We settle the cases r = 3 and r ≥ 5, and give partial results for the very interesting case r = 4.

AB - We investigate whether Kr-free graphs with few repetitions in the degree sequence may have independence number o(n). We settle the cases r = 3 and r ≥ 5, and give partial results for the very interesting case r = 4.

UR - http://www.scopus.com/inward/record.url?scp=0041635667&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041635667&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(93)E0226-T

DO - 10.1016/0012-365X(93)E0226-T

M3 - Article

AN - SCOPUS:0041635667

VL - 141

SP - 285

EP - 290

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -