On Potentially K_5-E_3-graphic Sequences

Simple item page
dc.creatorHu, Lili
dc.creatorLai, Chunhui
dc.date2007-02-09
dc.date2007-09-17
dc.date.accessioned2026-07-07T08:29:45Z
dc.date.available2026-07-07T08:29:45Z
dc.descriptionLet $K_m-H$ be the graph obtained from $K_m$ by removing the edges set $E(H)$ of $H$ where $H$ is a subgraph of $K_m$. In this paper, we characterize the potentially $K_5-P_3$, $K_5-A_3$, $K_5-K_3$ and $K_5-K_{1,3}$-graphic sequences where $A_3$ is $P_2\cup K_2$. Moreover, we also characterize the potentially $K_5-2K_2$-graphic sequences where $pK_2$ is the matching consisted of $p$ edges.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/math/0702245
dc.identifierhttp://arxiv.org/abs/math/0702245
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138048
dc.subjectCombinatorics
dc.subject05C07
dc.titleOn Potentially K_5-E_3-graphic Sequences
dc.typetext

Files

Collections

arXiv