Pancyclic graphs and a conjecture of Bondy and Chvátal
✍ Scribed by E.F Schmeichel; S.L Hakimi
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 618 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We investigate the relations among the chromatic index q(X), the maximum degree d(Z), the total chromatic number q\*(Z), and the maximum size d,(Z) of an intersecting subhypergraph of a hypergraph Z: For some particular classes of hypergraphs, including Steiner systems, we provide sufficient conditi
We give a survey of results and conjectures concerning sufficient conditions in terms of connectivity and independence number for which a graph or digraph has various path or cyclic properties, for example hamilton path/cycle, hamilton connected, pancyclic, path/cycle covers, 2-cyclic.