| Autor: |
Zhou, Caifeng, Zhang, Yuqin, Guo, Yan |
| Zdroj: |
Graphs & Combinatorics; Dec2024, Vol. 40 Issue 6, p1-13, 13p |
| Abstrakt: |
Let H be a subgraph of graph G. If the edge set of G can be partitioned into edge-disjoint copies of H, possibly with some remainder edges, then the partition is called an H-packing in G. A maximal H-packing in G is defined as one where the remainder edges do not contain any copies of H. A maximal H-packing of G is considered maximum if the edge set E(G) cannot be partitioned into an H-packing containing more copies of H. A graph G is referred to as being H-equipackable if every maximal H-packing in G is also maximum H-packing. In this paper, we provide a characterization for all P 3 ∪ P 2 -equipackable graphs with 3 m (m ≥ 1) edges, where P 3 ∪ P 2 represents the union of two disjoint paths with 3 vertices and 2 vertices. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink