On potentially $K_6-C_5$ graphic sequences
Combinatorics
2009-09-29 v2
Abstract
For given a graph , a graphic sequence is said to be potentially -graphic if there exists a realization of containing as a subgraph. In this paper, we characterize the potentially -graphic sequences.
Keywords
Cite
@article{arxiv.0812.4861,
title = {On potentially $K_6-C_5$ graphic sequences},
author = {Zhenghua Xu and Chunhui Lai},
journal= {arXiv preprint arXiv:0812.4861},
year = {2009}
}
Comments
20 pages