A Characterization On Potentially $K_6-C_4$-graphic Sequences
| dc.creator | Hu, Lili | |
| dc.creator | Lai, Chunhui | |
| dc.date | 2009-01-10 | |
| dc.date.accessioned | 2026-07-07T12:28:16Z | |
| dc.date.available | 2026-07-07T12:28:16Z | |
| dc.description | For given a graph $H$, a graphic sequence $π=(d_1,d_2,...,d_n)$ is said to be potentially $H$-graphic if there exists a realization of $π$ containing $H$ as a subgraph. Let $K_m-H$ be the graph obtained from $K_m$ by removing the edges set $E(H)$ where $H$ is a subgraph of $K_m$. In this paper, we characterize the potentially $K_6-C_4$-graphic sequences. This characterization implies a theorem due to Hu and Lai [7]. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/0901.1356 | |
| dc.identifier | http://arxiv.org/abs/0901.1356 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215482 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C07 | |
| dc.title | A Characterization On Potentially $K_6-C_4$-graphic Sequences | |
| dc.type | text |