Click on our book to order NOW!

Use discount code ADC20 at checkout for a 30% discount!

Sponsors for the 55th SEICCGTC

World Scientific (WS) - iG Publishing

55th Southeastern International Conference on Combinatorics, Graph Theory & Computing

March 4-8, 2024

Group Photo

The Fifty-fifth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) will be held March 4-8, 2024 in the Student Union at Florida Atlantic University in Boca Raton, FL. The main campus is located three miles from the Atlantic Ocean, on an 850-acre site in Boca Raton, south of Palm Beach and north of Fort Lauderdale and Miami. The climate is subtropical with an average temperature of 75 degrees.

This years 55th conference will be a fully in-person conference held on our beautiful campus in lovely Boca Raton, Florida!

Invited speakers for this year's 55th SEICCGTC:

Miklos Bona, University of Florida, USA
Jason Brown, Dalhousie University, Canada
Charles Colbourn, Arizona State University, USA
Martin Golumbic, University of Haifa, Israel
Fan Chung Graham, University of California, San Diego, USA
Marijn Heule, Carnegie Mellon University, USA
Ilias Kotsireas, Wilfrid Laurier University, Canada
Ivelisse Rubio, University of Puerto Rico, Rio Piedras, USA
Douglas Stinson, University of Waterloo, Canada

Celebrating its 55th year, the Conference brings together mathematicians and others interested in combinatorics, graph theory and computing, and their interactions. The Conference lectures and contributed papers, as well as the opportunities for informal conversations, have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional work in business, industry, and government.

The Conference continues to promote better understanding of the roles of modern applied mathematics, combinatorics, and computer science to acquaint the investigator in each of these areas with the various techniques and algorithms which are available to assist in his or her research. Each discipline has contributed greatly to the others, and the purpose of the Conference is to decrease even further the gaps between the fields.

The organizing committee members (Frederick Hoffman, Ronald C. Mullin, and Stephen Locke) cordially invite participation in our Conference by interested persons in the academic community as well as business, industry and government. The conference advisory committee members are: Miklos Bona, (University of Florida); David Brown, (Utah State University); Kim Factor, (Marquette University); Martin Golumbic, (University of Haifa); Leslie Hogben (Iowa State University and American Institute on Mathematics (AIM)); Sarah Holliday, (Kennesaw State University); Edoardo Persichetti, (Florida Atlantic University); Ivelisse Rubio, (University of Puerto Rico, Rio Piedras); John Wierman (Johns Hopkins University), Maria Provost, (Florida Atlantic University).

The 55th Conference is partially supported by the National Security Agency, the National Science Foundation and the Institute for Combinatorics and its Applications.

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing March 4-8, 2024
Abstracts

* Special Session:	Algorithmic Graph Theory	Organizer: Bernard Ries and Chinh Hoang
** Special Session:	Enumerative Combinatorics	Organizers: Miklos Bona
Name	Institution	Abstracts
Abdallah, Mohamad	American University of Kuwait	Neighbor-Connectivity of Cayley Graphs Generated by Trees and Unicyclic Graphs
Abueida, Atif	University of Dayton	On (C₄, E₂)-decompositions of the complete 3-uniform hypergraph K_n(3)
Agrahari, Gyaneshwar	Louisiana State University	Cycles-Related Γ-Harmonious Graphs
Ahmad, Uzma	University of Punjab	Anti-reciprocal Eigenvalue Property of Graphs
Ahn, Jungho *	Korea Institute for Advanced Study	Almost linear kernels for generalized covering and packing on sparse graphs
Alexseyev, Max	The George Washington University	From Privacy to Enumeration in a Restroom and Elsewhere
Akinola, Fatima	University of Florida	On Hamilton cycle decompositions of complete multipartite graphs which are both cyclic and symmetric
Andelic, Milica	Kuwait University	On the inverse Collatz-Sinogowitz irregularity problem
Archer, Kassie **	United States Navel Academy	Powers of permutations avoiding chains of patterns
Aweda, Oluwakayode	Georgia Southern University	A New Approach to Middle Level Problem
Bailey, Sean	Texas A&M University Texarkana	Combinatorially Orthogonal Graphs
Barrón, Jesús Sistos	Georgia Southern university	Counting conjugates of colored compositions
Barrus, Michael *	University of Rhode Island	Havel–Hakimi, Murphy, Maxine, and Hereditary Classes
Bauer, Morgan **	Eckerd College	A New Lower Bound for Deterministic Pop-Stack-Sorting
Benferhat, S.	University of Artois	On the graphical representation of wastewater networks data
Bereg, Sergey	The University of Texas at Dallas	Computing Random Matchings in Permutohedra
Bickle, Allan	Purdue University	Forbidden Subgraph Characterizations of Single Graphs
Blair, Howard	Syracuse University	Boolean Expressions as Continuous Time Differentiable Dynamical Systems
Bona, Miklos	University of Florida	Negative Results in Combinatorial Enumeration
Bowling, Andrew	University of Minnesota Duluth	Coloring, Cozonal Labelings, and Kempe Chains
Brown, Jason	Dalhousie University	A Love Affair with Graph Polynomials
Cameron, Kathie *	Wilfrid Laurier University	Reconfiguration of Vertex Colourings in Hereditary Classes of Graphs
Carr, John	University of North Alabama	Algebraically Describing Color Trades of Complete Bipartite Graphs
Che, Zhongyuan	Penn State University	Resonance graphs of plane bipartite graphs as daisy cubes
Chung Graham, Fan	University of California San Diego	Quasi-random boolean functions
Colbourn, Charles	Arizona State University	Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
Collins, Karen *	Wesleyan University	Blocks of Degree Sequences of Split Graphs
Conrad, Esther	National Aeronautics and Space Administration Langley Research Center	Formal Verification, Distributed Computing, and Path Planning Algorithms
Coopman, Michael **	University of Florida	Major index distribution
Curran, Stephen	University of Pittsburgh at Johnstown	Prime labelings on a 3 x n grid graph
Darrow, Brian	Southern Connecticut State University	Grate Expectations
Delgado, Moises	University of Puerto Rico at Cayey	Recent Advances Towards the Conjecture of Exceptional APN Functions
Dimitrov, Stoyan **	Rutgers University	The joint asymptotic normality of Spearman’s disarray and number of inversions
Dymacek, Wayne	Retired	Realizability of n-vertex graphs with prescribed vertex and edge connectivity and minimum and maximum degree, IV
Edmonds, Jack		Optimum Branching Systems
Emamy-K. M. R.	University of Puerto Rico, Rio Piedras	A System of Rotational Hyperplanes and a Simple Polytopal Path in Convexity
Engbers, John **	Marquette University	Reciprocals of Thinned Exponential Series
Erey, Aysel	Utah State University	Spreading in graphs
Eschen, Elaine *	West Virginia University	Bipartite completion of colored graphs avoiding chordless cycles of given lengths
Fields, Joe	Southern Connecticut State University	Grate Expectations
Flagg, Mary	University of St. Thomas	/combinatorics/abstracts/flagg55.pdf
Froncek, Dalibor	University of Minnesota Duluth	Γ-supermagic labeling of some regular graphs with dihedral groups
Fuentes, Melissa M.	Villanova University	The Extremality of 2-partite Tur´an Graphs with Respect to the Number of Colorings
Gallagher, Emma	Stonehill College	On Z₂ × Z_2- Magic Graphs and Circuits
Gao, Weizheng	Elizabeth City State University	Using Discrete Structures to Analyze Risk Assessments
Gezek, Mustafa	Tekirdag Namik Kemal University	Pedal sets of unitals embedded in projective planes of square order
Gilroy, Haile	Auburn University	Using path and star decompositions to design Derivative Computation task sets
Gnang, Edinah	Johns Hopkins University	A proof of the Graham–Sloane conjecture
Golumbic, Martin	University of Haifa	Containment Orders - A Lifelong Journey
Gossett, Ian *	Wesleyan University	Some Orientation Theorems for Restricted DP-colorings of Graphs
Gottlieb, Eric	Rhodes College	Conway-Gurvich Classification for Berlekamp’s Impartial Chess
Gould, Ronald	Emory University	Extending Some Pancyclicity Results
Guan, Puhua	University of Puerto Rico, Rio Riedras	Minimal number of colors for conflict free colorings of hypercube of dimension m
Hanna, Elizabeth	Stonehill College	On Z₂ × Z_2- Magic Graphs and Circuits
Harris, Isabel	Auburn University	AR_k -Bounded Graphs on the Complete Graph
Hell, Pavol *	Simon Fraser University	2-Direction Ray Graphs, Extension Theorems, and Dichotomy for Signed Graphs
Hernandez Cruz, César *	Universidad Nacional Autónoma de México	Linear Certifying Algorithms for Simple Graph Classes
Heule, Merijn	Carnegie Mellon University	Mathematics and Symbolic AI
Heuss, Sarah		Representatives of special families
Hoang, Chinh *	Wilfrid Laurier University	A closure lemma for tough graphs and Hamiltonian degree conditions
Hogenson, Kirsten	Skidmore College	Equitable Choosability of Prism Graphs
Hollenback, Jace	Stonehill College	AL(k)-spectrum for Cycles and Related Graphs
Isaak, Garth *	Lehigh University	Hamiltonian Path Variants in Structured Graph Families
Jackson, Jacob	Stonehill College	AL(k)-spectrum for Cycles and Related Graphs
Jacob, Dalu *	University of Haifa	New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring
Jerdee, Aidan	University of Minnesota Duluth	Super Edge-Magic Deficiencies of Books and Cycles
Johnson, Peter	Auburn University	Babai Numbers and Spectra of Paths and Cycles
Johnston, Daniel	Trinity College	Orientable total domination in graphs
Kingan, Sandra *	Brooklyn College and the Graduate Center, CUNY	Generating Cyclically 4-Connected Cubic Graphs
Kotsireas, Ilias	Wilfrid Laurier University	130+ years of the Hadamard conjecture
Kreher, Donald	Michigan Technological University	On min-base palindromic representations of powers of 2
Lau, Gee-Choon	77D, Jalan Subuh, Johor, Malaysia	Construction of fixed even size graphs with local antimagic chromatic number 3 - matrix & vertices merging approaches
Lee, Jinwook	Drexel University	Graph, moments, geometry for probabilities of events in the d-space
Limouzy, Vincent *	Université Clermont Auvergne, CNRS	On the equivalence of Strongly and Dually CPT graphs
Lipták, László	Oakland University	Edge join of cubic graphs
Low, Richard	San Jose State University	New Diagonal Graph Ramsey Numbers of Unicyclic Graphs
Mandrick, Sean **	University of Florida	Graphical Transpositions
Matijasevick, Mateo	Purdue University	Lattice Paths in Corridors and Cyclic Corridors
Mazza, Lucian	Oakland University	Unique Group Coloring of Graphs
Merz, Sarah	University of the Pacific	A matching problem inspired by a reality television show
Messigner, Margaret-Ellen *	Mount Allison University	Towards the Burning Number Conjecture
Meyerowitz, Aaron	Florida Atlantic University	Neighborhood Balanced Colorings of Regular Graphs
Minion, Sarah	University of South Florida	Method to Construct All 2-Sided Strip Polyominoes
Myers, Timothy	Howard University	Some New Occurrences of the Central Delannoy Numbers
Newman, Nick	Troy University	About Perfection of Circular Mixed Hypergraphs
Noble, Matt	Middle Georgia State University	On Graphs with Rainbow 1-Factorizations
Oberly, Samuel	Johns Hopkins University	Further Improvements to the Upper Bound for the Site Percolation Threshold of the Square Lattice
Owens, Andrew	Widener University	Word-Representable Graphs: Orientations, Posets, and Bounds
Pappe, Joseph **	Colorado State University	Cyclic Sieving Phenomenon for Fans of Dyck Paths
Pfaltz, John	University of Virginia	The Hidden Structure of Finite Union-Closed Set Systems
Porschen, Stefan	HTW Berlin	On CNF Base Hypergraphs
Reiswig, Josiah	Anderson University	The degree/Steiner k-diameter problem for trees
Ries, Bernard *	University of Fribourg, Switzerland	Matching Cuts in Graphs of High Girth and H-Free Graphs
Rombach, Puck	University of Vermont	Positroids over F3
Rubio, Ivelisse	University of Puerto Rico, Rio Piedras	Multidimensional Costas Arrays
Schroder, Bernd **	The University of Southern Mississippi	Melding Combinatorics and Group Theory to Confirm The Automorphism Conjecture for Ordered Sets?
Schroeder, Michael	Stetson University	Primitive Cycle Decompositions
Schwartz, Andrew	Southeast Missouri State University	The zero forcing numbers and propagation times of gear graphs and helm graphs
Seamone, Ben	Dawson College	On the eviction model of eternal domination
Sepanski, Mark	Baylor University	Young Tableau Reconstruction Via Minors
Shozi, Zekhaya	Sol Plaatje University	The Number of k-Nearly Independent Subsets
Sinko, Anne	College of Saint Benedict/Saint John's University	Chromatic-Partition Number in Graphs
Smyth, Clifford **	University of North Carolina, Greensboro	Total Non-negativity of Generating Functions
Soifer, Alexander	University of Colorado at Colorado Springs	What is new in “The New Mathematical Coloring Book?”
Southwood, Garrett	Georgia Southern University	The Combinatorics of Increasing Graphs
Spinrad, Jeremy *	Vanderbilt University	New Questions on Partial Orders and Sorting
Stern, Michal *	Academic College of Tel Aviv - Yaffo	Gaining clustered trees on grid hypergraph intersection graphs
Stinson, Douglas	University of Waterloo and Carleton University	A Compendium of Difference Families
Su, Hsin-hao	Stonehill College	On Subdivision Graphs of Cylinder Graphs which are 2-steps Hamiltonian
Sullivan, Shaun **	Florida Gulf Coast University	Combinatorics of lane merging: Limited Capacity Lanes
Tesman, Barry	Dickinson College	Directed T-colorings
Tiemeyer, Michael	Georgia Southern University	On z-cycle factorizations with two associate classes where z is 2a
Trenk, Ann *	Wellesley College	Split Graphs and Amphoras in Posets
Van Nimwegen, Nicholas	University of Florida	A Combinatorial Proof for 132-Avoiding Permutations with a Unique Longest Increasing Subsequence
Vindas-Meléndez, Andrés **	University of California, Berkeley	Stack-sorting simplices: geometry and lattice-point enumeration
Wang, Hua **	Georgia Southern University	Coloring compositions by part positions
Wang, Ping	St. Francis Xavier University	The surviving rate C₇-free planar graph
Wiederrecht, Sebastian *	Institute for Basic Science (IBS)	Bipartite Treewidth: Odd-minors and maximum independent set
Wierman, John	Johns Hopkins University	Upper Bounds for Bond Percolation Thresholds of Stacked Lattices
Wisby, Justin	Florida International University	Domination in Token Graphs of Graph Families
Wong, Alexander **	University of Florida	Approximating Hipster Tree Growth Rates
Xie, Weiguo	University of Minnesota Duluth	An Enhanced Systematic Rotation Method for Coloring Plane Graphs
Yuan, Xiaofan	Arizona State University	On Rainbow Thresholds
Zajchowski, Miro	University of Minnesota Duluth	Super Edge Magic Deficiencies of Various Classes of Graphs
Zhang, Yufei **	University of Notre Dame	Totally non-negativity of a family of change-of-basis matrices

View Past Conference Abstracts

DAILY SCHEDULE

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Monday, March 4
8:00 a.m.	Check-in and Registration (outside Grand Palm Room)
9:00 a.m.	Welcome and opening remarks: Valery Forbes, Dean and Professor, Charles E. Schmidt College of Science Grand Palm Room Yuan Wang, Professor and Chair, Department of Mathematics and Statistics
9:30 a.m.	Plenary Speaker: Miklos Bona, University of Florida (Grand Palm Room)
10:30 a.m.	COFFEE
Special Session	(Live Oak D) Enumerative Combinatorics Organizer: Miklos Bona, University of Florida
11:00 a.m.	(Live Oak B) \| Darrow & Fields (Live Oak C) \| Engbers ** (Live Oak D) \|
11:20 a.m.	(Live Oak B) \| Aweda (Live Oak C) \| Coopman ** (Live Oak D) \|
11:40 a.m.	(Live Oak B) \| Bailey (Live Oak C) \| Schroder ** (Live Oak D) \|
12:00 p.m.	(Live Oak B) \| Barron (Live Oak C) \| Alekseyev ** (Live Oak D) \|
12:20 p.m.	Lunch (on your own)
2:00 p.m.	Plenary Speaker: Ivelisse Rubio, University of Puerto Rico Rio Piedras (Grand Palm Room)
3:00 p.m.	COFFEE
Special Session *	(Live Oak D) Enumerative Combinatorics Organizer: Miklos Bona
3:20 p.m.	Johnston (Live Oak B) \| Southwood (Live Oak C) \| Bauer ** (Live Oak D) \|
3:40 p.m.	Tiemeyer (Live Oak B) \| Owens (Live Oak C) \| Wang, H. ** (Live Oak D) \|
4:00 p.m.	Merz (Live Oak B) \| Minion (Live Oak C) \| Zhang ** (Live Oak D) \|
4:20 p.m.	Bickle (Live Oak B) \| Gould (Live Oak C) \| Archer ** (Live Oak D) \|
4:40 p.m.	Rombach Live Oak B) \| Sepanski (Live Oak C) \| Mandrick ** (Live Oak D) \|
5:00 p.m.	Gao ( Live Oak B) \| Liptak (Live Oak C) \| Wong ** (Live Oak D) \|
5:20 p.m.	(Live Oak B) \| Benferhat (Live Oak C) \| Van Nimwegen ** (Live Oak D) \|
5:40 p.m.	(Live Oak B) \| (Live Oak C) \| Pappe * (Live Oak D) \|
6:00 p.m.	Evening event: Live Oak Patio All are Welcome!
55th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Tuesday, March 5
8:00 a.m.	Check-in and Registration (outside Grand Palm Room)
8:00 a.m.	Industry Career Panel : Panelists will provide relevant insights into a variety of career paths using mathematics in an industrial setting. Hear from Florida Atlantic University alumni about their day-to-day work, trends in the field and how to best position oneself with skills and experiences to be competitive for internship and full-time opportunities.
9:30 a.m.	Plenary Speaker: Martin Golumbic, University of Haifa , Israel (Grand Palm Room)
10:30 a.m.	COFFEE
Special Session *	(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang
10:50 a.m.	Bowling (Live Oak B) \| Myers (Live Oak C) \| Eschen * (Live Oak D) \|
11:10 a.m.	Lau (Live Oak B) \| Pfaltz (Live Oak C) \| Isaak * (Live Oak D) \|
11:30 a.m.	Agrahari (Live Oak B) \| Akinola (Live Oak C) \| Hoang * (Live Oak D) \|
11:50 a.m.	Curran (Live Oak B) \| Newman (Live Oak C) \| Kingan * (Live Oak D) \|
12:10 p.m.	Froncek (Live Oak B) \| Carr (Live Oak C) \| Kingan * (Live Oak D) \|
12:30 p.m.	LUNCH (on your own)
2:00 p.m.	Plenary Speaker: Fan Chung Graham, University of California, San Diego (Grand Palm Room)
3:00 p.m.	COFFEE
Special Session * Special Session **	(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang (Live Oak C) Enumerative Combinatorics Organizer: Miklos Bona
3:20 p.m.	Fuentes (Live Oak B) \| Dimitrov ** (Live Oak C) \| Cameron * (Live Oak D) \|
3:40 p.m.	Tesman (Live Oak B) \| Vindas-Menendez ** (Live Oak C) \| Cameron * (Con't) (Live Oak D \|
4:00 p.m.	Sinko (Live Oak B) \| Sullivan ** (Live Oak C) \| Hell * (Live Oak D \|
4:20 p.m.	Xie (Live Oak B) \| Smyth (cancelled) ** (Live Oak C) \| Hell * (Con't) (Live Oak D) \|
4:40 p.m.	Mazza (Live Oak B) \| Bereg ** (Live Oak C) \| \| Wiederrecht * (Live Oak D) \|
5:00 p.m.	Schroeder (Live Oak B) \| Abdallah (Live Oak C) \| Stern * (Live Oak D) \|
5:20 p.m.	(Live Oak B) \| Dymacek (Live Oak C) \| Gossett * (Live Oak D) \|
6:00 p.m.	Evening event: Majestic Palm Room

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Wednesday, March 6
8:00 a.m.	Check-in and Registration (outside Grand Palm Room)
9:30 a.m.	Plenary Speaker: Merijn Heule, Carnegie Mellon University (Grand Palm Room)
10:30 a.m.	CONFERENCE PHOTO
10:40 a.m.	COFFEE
Special Session *	(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang
11:00 a.m.	Oberly (Live Oak B) \| Wisby (Live Oak C) \| Trenk * (Live Oak D) \|
11:20 a.m.	Wierman (Live Oak B) \| Seamone (Live Oak C) \| Trenk * (Live Oak D) \|
11:40 a.m	Lee (Live Oak B) \| Flagg (Live Oak C) \| Hernandez-Cruz * (Live Oak D) \|
12:00 p.m.	Emamy-K (Live Oak B) \| Kreher (Live Oak C) \| Jacob * (Live Oak D) \|
12:20 p.m.	Che (Live Oak B) \| Reiswig (Live Oak C) \| Ahn * (Live Oak D) \|
12:40 p.m.	LUNCH (on your own)
2:00 p.m.	Plenary Speaker: Douglas Stinson, University of Waterloo and Carleton University (Grand Palm Room)
3:00 p.m.	COFFEE
Special Session *	(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang
3:20 p.m.	Jackson & Hollenbach (Live Oak B)\| Guan (Live Oak) \| Messinger * (Live Oak D) \|
3:40 p.m.	Su (Live Oak B)\| Hogenson (Live Oak C) \| Messinger * (con't) (Live Oak D \|
4:00 p.m.	Matijasevick (Live Oak B) \| Noble (Live Oak C) \| Ries * (Live Oak D) \|
4:20 p.m.	Johnson (Live Oak B) \| Erey (Live Oak C) \| Barrus * (Live Oak D) \|
4:40 p.m.	(Live Oak B) \| Low (Live Oak C) \| * (Live Oak D) \|
5:00 p.m.	(Live Oak B) \| Schwartz (Live Oak C) \| Spinrad * (Live Oak D) \|
5:20 p.m.	(Live Oak B) \| Meyerowitz (Live Oak C) \| Limouzy * (Live Oak D) \|
5:40 p.m.	(Live Oak B) \| Harris, I . (Live Oak C) \| Limouzy * (Live Oak D) \|
6:00 p.m.	CONFERENCE BANQUET (Maggiano's, Boca Raton, Florida)

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Thursday, March 7
8:00 a.m.	Check-in and Registration (outside Grand Palm Room)
9:30 a.m.	Plenary Speaker: Jason Brown, Dalhousie University (Grand Palm Room)
10:30 a.m.	COFFEE
10:50 a.m.	Gallagher & Hanna (Live Oak B) \| Heuss (Live Oak C) \| Edmonds (Live Oak D) \|
11:10 a.m.	Gnang (Live Oak B) \| Abueida (Live Oak C) \| Gilroy (Live Oak D) \|
11:30 a.m.	Jerdee (Live Oak B) \| Yuan (cancelled) (Live Oak C) \| Wang, Ping (Live Oak D) \|
11:50 a.m.	Zajchowski (Live Oak B) \| Porschen (cancelled) (cancelled) (Live Oak C) \| Soifer (Live Oak D) \|
12:30 p.m.	DEPART FOR MORIKAMI MUSEUM AND JAPANESE GARDENS AND WAKODAHATCHEE NATURE PRESERVE
12:30 p.m.	LUNCH (on your own)
6:00 p.m.	Evening Event (The Atrium, Engineering East)

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing
Friday, March 8
9:30 a.m.	Plenary Speaker: Charlie Colbourn, Arizona State University (Grand Palm Room)
10:30 a.m.	COFFEE
10:50 a.m.	(Live Oak B) \| Gezek (Live Oak C) \| Gottlieb (Live Oak D) \|
11:10 a.m.	(Live Oak B) \| Blair (Live Oak C) \| Conrad (Live Oak D) \|
11:30 a.m.	(Live Oak B) \| Shozi (Live Oak C) \| Delgado (Live Oak D) \|
11:50 a.m.	(Live Oak B) \| Andelic (Live Oak C) \| (Live Oak D) \|
12:30 p.m.	(Live Oak B) \| Ahmad (Live Oak C) \| (Live Oak D) \|
2:00 p.m.	Plenary Speaker: Ilias Kotsireas, Wilfrid Laurier University (Grand Palm Room)
3:00 p.m.	COFFEE
7:00 p.m.	Survivor's Party! See Maria at the Registration Desk for all of the information

Click on our book to order NOW!

Use discount code ADC20 at checkout for a 30% discount!

Sponsors for the 55th SEICCGTC

55th Southeastern International Conference on Combinatorics, Graph Theory & Computing

March 4-8, 2024

Invited speakers for this year's 55th SEICCGTC:

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing

March 4-8, 2024

Abstracts

Name

Institution

Abstracts

View Past Conference Abstracts

DAILY SCHEDULE

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing

Monday, March 4

(Live Oak D) Enumerative Combinatorics Organizer: Miklos Bona, University of Florida

(Live Oak D) Enumerative Combinatorics Organizer: Miklos Bona

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing

Tuesday, March 5

(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang

Special Session *

(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing

Wednesday, March 6

(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang

(Live Oak D) Algorithmic Graph Theory Organizers: Bernard Ries and Chinh Hoang

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing

Thursday, March 7

55th Southeastern International Conference on Combinatorics, Graph Theory and Computing

Friday, March 8