Some Recent Results on Graph Matching
✍ Scribed by LÁSZLÓ LOVÁSZ; MICHAEL D. PLUMMER
- Book ID
- 119862790
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 542 KB
- Volume
- 576
- Category
- Article
- ISSN
- 0890-6564
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A variety of recent developments in hamiltonian theory are reviewed. In particular, several sufficient conditions for a graph to be hamiltonian, certain hamiltonian properties of line graphs, and various hamiltonian properties of powers of graphs are discussed. Furthermore, the concept
I will mention two of my favourite problems in which recently important progress was made. The other questions I will mention are perhaps less well known. 1. Faber, Lowisz and I conjectured more than 20 years ago that if Gi, 1 <<.i~n are n G n edge disjoint complete graphs of size n then Ui=l i has