Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

A graphic sequence π = ( d 1 , d 2 , … , d n ) is said to be potentially K r + 1 -graphic, if π has a realization G containing K r + 1 , a clique of r + 1 vertices, as a subgraph. In this paper, we give two simple sufficient conditions for a graphic sequence π = ( d 1 , d 2 , … , d n ) to be potenti...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics Vol. 301; no. 2; pp. 218 - 227
Main Authors: Yin, Jian-Hua, Li, Jiong-Sheng
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 06.10.2005
Elsevier
Subjects:
ISSN:0012-365X, 1872-681X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first