| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438853 | Theoretical Computer Science | 2006 | 7 Pages |
Abstract
A join graph is the complete union of two arbitrary graphs. We give sufficient conditions for a join graph to be 1-factorizable. As a consequence of our results, the Hilton’s Overfull Subgraph Conjecture holds true for several subclasses of join graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
