Pack Graphs with Subgraphs of Size Three

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2018-02-01

類型

期刊名稱

TAIWANESE JOURNAL OF MATHEMATICS

卷期與頁次

第 22 卷,頁 1–15

ISSN

1027-5487

語言

英文

摘要

An H -packing F of a graph G is a set of edge -disjoint subgraphs of G in which each subgraph is isomorphic to H. The leave L or the remainder graph L of a packing F is the subgraph induced by the set of edges of G that does not occur in any subgraph of the packing F. If a leave L contains no edges, or simply L = Phi, then G is said to be H -decomposable, denoted by H broken vertical bar G. In this paper, we prove a conjecture made by Chartrand, Saba and Mynhardt [13]: If G is a graph of size q(G) 0 (mod 3) and delta(G) >= 2, then G is H -decomposable for some graph H of size 3.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, Z.-C., Fu, H.-L., & Huang, K.-C. (2018). Pack Graphs with Subgraphs of Size Three. TAIWANESE JOURNAL OF MATHEMATICS, 22, 1–15. https://doi.org/10.11650/tjm/8093

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144470