BibTeX
CSL-JSON
MLA
Harvard
On Potentially (K_5-H)-graphic Sequences
release_cej76zd4znghtfbq4lo767tchu
by
Lili Hu, Chunhui Lai, Ping Wang
Released
as a article
.
2007
Abstract
Let 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_4 and K_5-Y_4-graphic sequences where Y_4 is a tree on
5 vertices and 3 leaves.
In text/plain
format
Archived Files and Locations
application/pdf 178.4 kB
file_l3xnxj5gh5dtfb3pr5seclhdx4
|
archive.org (archive) |
Read Archived PDF
Preserved and Accessible
arXiv
math/0702166v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links