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

DOI10.1016/0012-365X(94)E0224-6zbMath0833.05074OpenAlexW2042794444MaRDI QIDQ1894779

William Staton, Talmage James Reid, Paul Erdős, Richard H. Schelp, Ralph J. Faudree

Publication date: 5 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)e0224-6

zbMATH Keywords

independence numberdegree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

Independent sets and repeated degrees, Large induced subgraphs with three repeated degrees, Equating two maximum degrees

Cites Work

• Degree sequences in triangle-free graphs
• On a Ramsey-Turán type problem
• Graph Theory and Probability
• Unnamed Item