Pack graphs with subgraphs of size three

Zhen Chun Chen, Hung-Lin Fu, Kuo Ching Huang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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 = φ, then G is said to be H-decomposable, denoted by H

Original languageEnglish
Pages (from-to)1-15
Number of pages15
JournalTaiwanese Journal of Mathematics
Volume22
Issue number1
DOIs
StatePublished - 1 Feb 2018

Keywords

  • Graph decomposition
  • H-decomposition
  • H-packing
  • Maximum packing
  • Minimum leave
  • Packing

Fingerprint Dive into the research topics of 'Pack graphs with subgraphs of size three'. Together they form a unique fingerprint.

Cite this