On Potentially $(K_5-C_4)$-graphic Sequences

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, we characterize the potentially $(K_5-C_4)$-graphic sequences where $K_5-C_4$ is the graph obtained from $K_5$ by removing four edges of a 4 cycle $C_4$. This characterization implies a theorem due to Lai [6].
18 pages

Keywords

Combinatorics, 05C07

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/120953

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0701023
 http://arxiv.org/abs/math/0701023

Collections

arXiv