{"product_id":"combinatorics-graph-theory-and-computing-ebook","title":"Combinatorics, Graph Theory and Computing","description":"\u003cp\u003e1 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.\u003c\/p\u003e","brand":"Frederick Hoffman","offers":[{"title":"Default Title","offer_id":53652879999303,"sku":"9783031838644","price":245.03,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0920\/5455\/2903\/files\/combinatorics-graph-theory-and-computing-ebook-cover.webp?v=1775384514","url":"https:\/\/www.cinebuch.de\/products\/combinatorics-graph-theory-and-computing-ebook","provider":"CineBuch","version":"1.0","type":"link"}