标题: Pack Graphs with Subgraphs of Size Three
作者: Chen, Zhen-Chun
Fu, Hung-Lin
Huang, Kuo-Ching
应用数学系
Department of Applied Mathematics
关键字: graph decomposition;H-decomposition;packing;H-packing;maximum packing;minimum leave
公开日期: 1-二月-2018
摘要: 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.
URI: http://dx.doi.org/10.11650/tjm/8093
http://hdl.handle.net/11536/144470
ISSN: 1027-5487
DOI: 10.11650/tjm/8093
期刊: TAIWANESE JOURNAL OF MATHEMATICS
Volume: 22
起始页: 1
结束页: 15
显示于类别:Articles