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

Simple item page
dc.creatorHu, Lili
dc.creatorLai, Chunhui
dc.date2006-12-31
dc.date.accessioned2026-07-07T07:37:57Z
dc.date.available2026-07-07T07:37:57Z
dc.descriptionIn 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].
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math/0701023
dc.identifierhttp://arxiv.org/abs/math/0701023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120953
dc.subjectCombinatorics
dc.subject05C07
dc.titleOn Potentially $(K_5-C_4)$-graphic Sequences
dc.typetext

Files

Collections

arXiv