My Account Log in

1 option

Combinatorics, Graph Theory and Computing : SEICCGTC 2023, Boca Raton, USA, March 6–10 / edited by Sarah Heuss, Richard M. Low, John C. Wierman.

Springer Nature - Springer Mathematics and Statistics (R0) eBooks 2025 English International Available online

View online
Format:
Book
Author/Creator:
Hoffman, Frederick.
Contributor:
Heuss, Sarah.
Low, Richard M.
Wierman, John C.
Series:
Springer Proceedings in Mathematics & Statistics, 2194-1017 ; 489
Language:
English
Subjects (All):
Graph theory.
Probabilities.
Algorithms.
Graph Theory.
Graph Theory in Probability.
Local Subjects:
Graph Theory.
Graph Theory in Probability.
Algorithms.
Physical Description:
1 online resource (385 pages)
Edition:
1st ed. 2025.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Summary:
This proceedings volume compiles selected, revised papers presented at the 54th Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC 2023), which took place at Florida Atlantic University in Boca Raton, USA, from March 6th to 10th, 2023. The SEICCGTC is widely regarded as a trendsetter for other conferences worldwide. Many ideas and themes initially discussed here have subsequently been explored in other conferences and symposia. Since 1970, the conference has been held annually in Baton Rouge, Louisiana, and Boca Raton, Florida. Over the years, it has grown to become the primary annual conference in its fields, playing a crucial role in disseminating results and fostering collaborative work. This volume is tailored for the community of pure and applied mathematicians in academia, industry, and government, who work in combinatorics and graph theory, as well as related areas of computer science and the intersections among these fields.
Contents:
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.
Notes:
Description based on publisher supplied metadata and other sources.
ISBN:
3-031-83864-5
OCLC:
1530381199

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account