Cycles in Graphs (eBook)

B.R. Alspach, C.D. Godsil (Herausgeber)

eBook Download: PDF

1985 | 1. Auflage
466 Seiten
Elsevier Science (Verlag)
978-0-08-087226-1 (ISBN)

Infos

This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.

Inhalt

Front Cover 1
Cycle in Graphs 4
Copyright Page 5
Table of Contents 8
Foreword 6
Chapter 1. A Survey of the Cycle Double Cover Conjecture 12
Chapter 2. A Girth Requirement for the Double Cycle Cover Conjecture 24
Chapter 3. Hamilton Cycles in Metacirculant Graphs with Prime Cardinality Blocks 38
Chapter 4. Hamilton Paths in Cartesian Products of Directed Cycles 46
Chapter 5. Every Connected Cayley Graph of a Group with Prime Order Commutator Group Has a Hamilton Cycle 86
Chapter 6. Multiple-Ply Hamiltonian Graphs and Digraphs 92
Chapter 7. On Hamilton Cycles in Cayley Graphs in Groups with Cyclic Commutator Subgroup 100
Chapter 8. Hamilton Circuits in Cartesian Products with a Metacyclic Factor 114
Chapter 9. Vertex Transitive Graphs and Digraphs of Order pk 126
Chapter 10. Some Hamiltonian Cayley Graphs 140
Chapter 11. On Hamilton Cycles in 3-Connected Cubic Maps 152
Chapter 12. Non-Hamiltonian 3-Polytopes Whose Faces Are All Pentagons 162
Chapter 13. Hamilton Circuits in Regular Tournaments 170
Chapter 14. Circuits and Hamilton Circuits in Domination Orientable Tournaments 174
Chapter 15. First Occurrence of Hamilton Cycles in Random Graphs 184
Chapter 16. The Pancyclicity of Halin Graphs and their Exterior Contractions 190
Chapter 17. Long Paths between Specified Vertices of a Block 206
Chapter 18. Longest Cycles in 2-Connected Graphs of Independence Number a 212
Chapter 19. A Note on Maximal Cycles in 2-Connected Graphs 216
Chapter 20. A Note on Isomorphic Generalized Prisms 220
Chapter 21. Uniformly n-Cyclic Graphs 226
Chapter 22. Cycles in 3-Connected Cubic Planar Graphs 230
Chapter 23. A Lemma on Cycle Decompositions 238
Chapter 24. A Note on Hamilton Cycles 244
Chapter 25. A Counterexample to a Conjecture about Oriented Graphs 246
Chapter 26. An Improvement of Jackson's Result on Hamilton Cycles in 2-Connected Regular Graphs 248
Chapter 27. Finding Cycles of a Given Length 260
Chapter 28. Clique Coverings of Complements of Paths and Cycles 268
Chapter 29. Equicardinal Disjoint Cycles in Sparse Graphs 280
Chapter 30. Path and Cycle Decompositions of Complete Multigraphs 286
Chapter 31. Minimum Number of Circuits Covering the Vertices of a Strong Digraph 298
Chapter 32. On Decomposing Graphs into Isomorphic Uniform 2-Factors 308
Chapter 33. Two Complementary Circuits in Two-Connected Tournaments 332
Chapter 34. The Clique Partition Number of the Complement of a Cycle 346
Chapter 35. The Computational Complexity of Decomposing Block Designs 356
Chapter 36. Kotzig's Conjecture on Generalized Friendship Graphs - A Survey 362
Chapter 37. A Short Proof of Rubin's Block Theorem 378
Chapter 38. Cycle Basis Interpolation Theorems 380
Chapter 39. A Basis for the Cycle Space of a 3-Connected Graph 392
Chapter 40. Types of Cycles in Hypergraphs 410
Chapter 41. Parity of Cycles Containing Specified Edges 430
Chapter 42. An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits 444
Chapter 43. The Reconstruction Conjecture for Balanced Signed Graphs 450
Chapter 44. Periodic Points of Small Periods of Continuous Mappings of Trees 454
Chapter 45. Periodic Points of Continuous Mappings of Trees 458
Chapter 46. Unsolved Problems 472

Produkt-Details

• Erscheint lt. Verlag: 1.8.1985
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Themenwelt: Technik
• ISBN-10: 0-08-087226-3 / 0080872263
• ISBN-13: 978-0-08-087226-1 / 9780080872261