不含K3的（p,p-1）图和（p,p-2）图的包装
불함K3적（p,p-1）도화（p,p-2）도적포장
Packing of a（p,p-1）-graph without K3 and a（p,p-2）}-graph
  • 万方数据
    桂林师范高等专科学校学报 계림사범고등전과학교학보
    JOURNAL OF GUILIN TEACHERS COLLEGE
    2012年 1期 143-145 ,共3页

    唐干武%秦桂毅%唐水忠%黄勇

    당간무%진계의%당수충%황용

    图%补图%嵌入%包装 圖%補圖%嵌入%包裝
    도%보도%감입%포장
    graphs%complementary%embedding%packing
    给出了不含K3的（p,p-1）图与同阶的（p,p-2）图可包装的充要条件。
    급출료불함K3적（p,p-1）도여동계적（p,p-2）도가포장적충요조건。
    In this paper,sufficient and necessary condition for packing of a（p,p-1）-graph without K3 and a（p,p-2）}-graph with the same order has been proved.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문