Abstract
We show that if G is the vertex-disjoint union of graphs with α-labelings, or if G is a comet, then there exists a graph H with an α-labeling such that H decomposes into two copies of G.
Original language | English |
---|---|
Pages (from-to) | 145-152 |
Number of pages | 8 |
Journal | Utilitas Mathematica |
Volume | 58 |
State | Published - 1 Nov 2000 |
Keywords
- Bipartite
- Comet
- Hammock
- α-labeling number