On Potentially $(K_5-C_4)$-graphic Sequences
Abstract
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].
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- December 2006
- DOI:
- 10.48550/arXiv.math/0701023
- arXiv:
- arXiv:math/0701023
- Bibcode:
- 2007math......1023H
- Keywords:
-
- Mathematics - Combinatorics;
- 05C07
- E-Print:
- 18 pages