｛（p,p-1）,（p,p-2）｝图对及树与（p,p-2）图的包装
｛（p,p-1）,（p,p-2）｝도대급수여（p,p-2）도적포장
Packing a Pair of Graphs {（p,p-1）,（p,p-2）} and Packing a Tree and a（p,p-2）-graph
  • 万方数据
    桂林师范高等专科学校学报 계림사범고등전과학교학보
    JOURNAL OF GUILIN TEACHERS COLLEGE
    2011年 3期 144-146 ,共3页

    秦桂毅%唐水忠%黄勇%王敏

    진계의%당수충%황용%왕민

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