Combinatorics, Graph Theory and Computing

1 Constraint Programming Generation of Optimal Balanced Incomplete Block Design.- 2 Some Remarks on Fibonacci-type Recursive Polynomials.- 3 Survival Probabilities of Counting-Out Games on a Line.- 4 Intersection of Longest Cycle and Largest Bond in 3-Connected Graphs.- 5 Characterizing Minimally 3-Connected Graphs.- 6 Properties of Pancentral and Related Graphs.- 7 The Gathering Number of a Graph and Vertex Degrees.- 8 Complete Multipartite Graphs are Pansophical.- 9 Superuser Pansophy.- 10 The Conclusion to the Edge-Balance Index Set Problem for Complete Bipartite Graphs.- 11 On Tight 6-Cycle Decompositions of Complete 3-Uniform Multi-Hypergraphs.- 12 An Extension of Seymour's Second Neighborhood Conjecture.- 13 k-Domination in Cartesian Product of Complete Graphs.- 14 On Irregular Domination in Graphs.- 15 Cop Numbers of Periodic Graphs.- 16 Euler's Formula for General Graph Embeddings.- 17 Ramsey Theory in Mathematical Olympiad and Nesting Parallelepipeds.- 18 Geometric Parameters of Bipartite Suspensions.

• Erscheinungsdatum: 16.07.2025
• Autor/Autorin: Frederick Hoffman
• Reihe: Springer Nature Proceedings excluding Computer Science
• Format: E-Book
• Dateiformat: PDF
• Kopierschutz: Wasserzeichen
• Dateigröße: 8.4 MB
• Verlag: SPRINGER
• Sprache: Englisch
• Umfang: 222 Seiten
• ISBN: 9783031838644
• Lieferung: Sofort per Download
• Hinweis: Sofort per Download lieferbar. Kein physischer Versand.
• Kompatibilität: Lesbar auf Geräten und Apps mit PDF-Unterstützung.