57th Southeastern International Conference on Combinatorics, Graph Theory, and Computing
March 9-13, 2026

Abstracts

   
* Special Session: Combinatorial Games Organizer:  Eric Gottlieb (Rhodes College)
** Special Session: Domination Organizers:  Sarah Heuss (University of South Carolina, Union)  and Anne Sinko (College of Saint Benedict and Saint John's University)
*** Special Session Graphs and Matrices Organizers:  Leslie Hogben (American Institute of Mathematics) and Mark Hunnell (Winston-Salem State University)
Highlighted Events    
Open Problem Session   Lightning Talks Organizers: Stephen Locke (Florida Atlantic University), Richard Low (San Jose State University)
Career Panel Business, Industry, and Government Career Panel                   Organizers: Beth Morrison (Air Force Research Lab), Maria Provost (Florida Atlantic University)
Name Institution Abstracts
Agrahari, Gyaneshwar Louisina State University Counting K1,t and K2,t in higher connected triangulations
Akinola, Fatima University of Florida Spread Function on Graphs
Alekseyev, Max A.  The George Washington University Efficient computing of bounded solutions to linear Diophantine equation with Euler’s totient function
Alspaugh, Peter University of South Florida Generalized Commutation in Semigroups
Barranca, Emily *** St. Mary’s College of Maryland A characterization of the Seidel spectrum for switching classes of graphs
Berliner, Adam *** St. Olaf College Refined inertia of fully positive patterns, hollow positive patterns, and everything in between
Bickle, Allan Purdue University Independent Sets of Cliques in Graphs
Bjorkman, Beth *** United States Air Force Research Lab Cost-Benefit Analysis for PMU Placement in Power Grids
Blair, Howard Syracuse University Digraphs: Homomorphism, Continuity, Differentiation
Bowie, Miranda ** University of North Alabama Liar’s Domination on Grid Graphs
Bowling, Andrew Wabash College Existence of generative strong Γ-zonal labelings for various Γ
Braginsky, Jacob Carnegie-Mellon University Exploring srg(45, 22, 10, 11) and implications for the Ramsey number R(5, 5)
Brennan, Zachary *** Argonne National Laboratory Optimization, Simulation, and Planning Heuristics in Global Logistics
Brimkov, Boris *** Slippery Rock University Throttling for metric dimension and its variants
Buck, Rylan University of South Florida 2D Tessellations of Square Chord Diagrams
Buehrle, Charles Notre Dame of Maryland University Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
Cameron, Thomas *** Penn State University Behrend On the minimal forts of trees
Carlson, Aidan University of Minnesota Duluth Decomposition of Complete Graphs Into Disconnected Triangular Graphs With 7 Edges
Catral, Minnie Xavier University of Louisiana Spectra of structured sign patterns
Chalise, Parik Johns Hopkins University Sufficiency of Hall’s condition in list coloring
Chatterjee, Ritabrato  Western Michigan University On Ramsey Chains in Graphs
Che, Zhongyuan Penn State University, Beaver Campus A decomposition structure of resonance graphs that are daisy cubes
Chen, Andrew Minnesota State University Moorhead An Efficient Algorithm for Dynamic Implicit Strict Posets with Conflict Resolution
Chen, Douglas ** Johns Hopkins University On Bounds and Exact Values for Total Domination Ratios of Archimedean Lattices
Chen, Henry Johns Hopkins University Improvements on the Bounds of Percolation Threshold for Archemedian Lattices of Degree 5
Collins, Karen *** Wesleyan University Color degree matrices and neighborhood ( k, λ )-balanced graphs
Corcoran, Aiden Florida Atlantic University Asymptotic Enumeration of Acyclic Orientations on Complete Multi-Partite Graphs
Corcoran, A./Rodriguez, E. Florida Atlantic University Finding the Distribution of the Length of the Longest Path of Acyclic Orientations on Complete Multi-Partite Graphs
Curbelo, Israel Kean University Asymptotic existence of off-diagonal online Ramsey numbers for paths
Curran, Stephen * University of Pittsburgh at Johnstown P -positions in Halve Nim
Darrow, Brian Central Connecticut State University Some Advancements in Grate Theory
Davenport, Dennis Howard University Row Sums and Alternating Row Sums of Exponential Riordan Array
Dawkins, Aleyah *** Carnegie-Mellon University Ramsey with wild edges
Deaett, Louis *** Quinnipiac University Matroids and minimum rank problems for matrix patterns and graphs
Deb, Aayan * Rhodes College AI-Assisted Development of an Interactive Platform for Some Combinatorial Games
Demiroglu Karabulut, Yesim California State University Sacramento Chromatic and achromatic numbers of unitary addition Cayley graphs
Dwip, Soumitro * Rhodes College Using an Interactive Platform to Generate Insights on Some Combinatorial Games
Emamy-K, M.R. University of Puerto Rico Rio Piedras The 5-cube cut number, cut-complexes, and a vertex coloring game
Farmer, Matthew C. Anderson University The Noncrossing Bond Poset of a Graph
Fehribach, Joseph D.  Worcester Polytechnic Institute Kirchhoff  Graphs
Flagg, Mary *** University of St. Thomas Reconfiguration for failed zero forcing and forts
Freyberg, Bryan University of Minnesota Duluth G -Designs for the Tadpole Graphs
Froncek, Dalibor University of Minnesota, Duluth ⌈-magic squares
Gao, Shanzhen Virginia State University Learning and Teaching Social Network Analysis with Artificial Intelligence, Generative AI, and Python in Google Colab
Gao, Weizhang Elizabeth City State University A Computational Approach to Growth Modeling Using Linear Recurrence Relations
Geneson, Jesse *** San Jose State University Randomized zero forcing on directed graphs
Gilroy, Haile McNeese State University Quantitative Graph Theory Approaches to Mathematics Textbook Analysis
Glover, Charles Independant Researcher A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
Gnang, Edinah Johns Hopkins University Towards a formal Lean4 proof that all trees are graceful
Gottlieb, Eric * Rhodes College Some P/N -positions and the CGH-classification of CRIM
Gould, Ronald J. Emory University Saturation Numbers For Some Dense Graphs
Gray, Daniel * Florida Atlantic University Split- S Nim
Hasan, Amber University of Texas at Dallas Improved Bounds for Permutation Arrays under Ulam Metric
Hernández-Cruz, César Universidad Nacional Autónoma de México A friendly generalization of split graphs
Heuss, Sarah ** University of South Carolina – Union Domination in Iterated Clique Graphs
Hockaday, Jeremiah * Dalhousie University The combinatorial game theory of Reverse Hex
Hopkins, Brian * St. Peter’s University Partition Kayles
Isaak, Garth Lehigh University Enumerating List Colorings
Jean, Devin ** Middle Tennessee State University Fractional Open-Locating-Dominating Sets
Johnson, Peter ** Auburn University Another look at an idea of Amin and Slater
Johnson, Seth University of Minnesota Duluth Decomposing Complete Graphs into Non-Lobsters With 12 or Fewer Edges
Kalantari, Bahman Rutgers University Approximating Bimatrix Nash Equilibrium via Trilinear Minimax
Kassie, Turner Concordia University Surface Areas of Select Interconnection Networks
Kennedy, Ken BMW Group Minimizing Intellectual Property Risks via Self-Stabilizing Algorithms
Khatana, Dawood * Rhodes College Row Impartial Terminus: A new Combinatorial Game
Levit, Vadim Ariel University On 1-König-Egerváry graphs
Li, Zhiyang Johns Hopkins University Stochastic Strategies for Rendezvous Search on Platonic Solids
Lin, Kailee Johns Hopkins University Light Vertex Fault Tolerant Graph Spanners via Connected Dominating Sets
Low, Richard San Jose State University Preservation of the Z k-antimagic Property of a Graph under Edge Addition
Lozano-Chávez, Humberto      Universidad Nacional Autónoma de México Monopolarity on (P5, house)-free graphs
Marr, Alison Southwestern University Playful Problems from a Math Capstone
Mcclinton, Brook Virginia State University Exploring Generative Graph Constructions Using Google Colab
McClinton, Matt University of Wisconsin, Milwaukee Metered Parking Functions
Merz, Sarah University of the Pacific The containment-intersection number
Meszka, Mariusz AGH University of Kraków Two-factorizations of some regular graphs
Minyard, Mitchell Baylor University On the Diameter of Generalized Petersen Graphs
Molina, Robert Alma College Solving Brainteasers and Puzzles with Graph Theory
Morgan, Gabrielle Elizabeth City State University
 		Exploring Linear Recursive Relations Through Python-Based Computation
Mukherjee, Sayan The University of Tokyo The bipartite graphs D′ ( k, q ) have low girth
Myers, Timothy Howard University C 4-Face-Magic on a 4 × 4 Klein Bottle Grid Graph
Naumova, Mariya * Rutgers Univversity On pet n -dimensional subtraction games
Noble, Matt Georgia State University On Single-Distance Graphs in Rn but Not Zn
Nochumson, Shayne Auburn University Counting Unlabeled Spanning Trees of Complete Bipartite Graphs
Ortiz San Miguel, Arturo Northeastern University Maximizing Subgraphs in Regular Graphs
Osborn, Sawyer Western Michigan University Proper Total Domination in Trees
Pantone, Jay Marquette University Combinatorial Exploration: An Algorithmic Framework for Enumeration
Pham, Van University of South Florida RNA-DNA Complex Structures Modeled with Wang-like Tiles
Powell, Samuel ** Utah State University Rainbow Dominating Sets of Graphs
Qiu, Ke Brock University Surface Areas of Select Interconnection Networks
Reinhart, Carolyn *** Swarthmore College Leaky Forcing for Unicyclic Graphs
Reiswig, Josiah Anderson University Steiner k -Skolem labeled graphs
Rock, Emerson University of Minnesota Duluth Decomposing Complete Graphs into Non-Lobsters With 12 or Fewer Edges
Rodriguez, Elisabeth Florida Atlantic University Finding the Distribution of the Length of the Longest Path of Acyclic Orientations on Complete Multi-Partite Graphs
Sayer, Evan Worcester Polytechnic Institute A Conjecture on Minimum Multiplicity for Kirchhoff Graphs
Schwartz, Andrew Southeast Missouri State University Forcing Sets with Connected Complements
Searns, Andrew Johns Hopkins University A Classification of Trees Without Unique Subgraphs
Sepanski, Mark Baylor University Chaotic and Periodic Behavior of Jeu de Taquin on Infinite Young Tableaux
Sharma, Gunjan Lake Forest College Shameful Inequalities for List and DP Coloring of Graphs
Sheppardson, Laura University of Mississippi Domination of Nanotube Fullerenes
Singh Saini, Bhavneet University of South Florida  Peripheral Linking Invariants of Embedded Curves in Space
Sinko, Anne ** College of Saint Benedict and Saint John’s University Extensions of Colored Domination
Stucky, Eric Nathan Independaent Researcher Homology in Simplicial Virtual Resolutions
Sullivan, Shaun Florida Gulf Coast University Some Algorithms for Burning Trees
Tankus. David ** Shamoon College of Engineering Recognizing Relating Edges in Graphs without Cycles of Length 6
Tesman, Barry Dickinson College A Mathematical Analysis of Tilt
Tiemeyer, Michael Georgia Southern University On z -cycle factorizations with two associate classes where z ∈ { ka, k } with even parameters
Trenk, Ann *** Wellesley College Color 2-switches and neighborhood (k, λ)-balanced graphs
Touzeau, Sid University of North Carolina, Wilmington Combining taxonomies for classification: when are sharks and dolphins similar?
V. Pragatheeswaran University of Miami Attention-Augmented Knowledge Graph Alignment for Evaluating LLM Factual Consistency
Vasilevska, Violetta *** Utah Valley University Leaky Forcing on Generalized Petersen Graphs
Villamizar, Diego *** Xavier University of Louisiana Symmetric Tensor Power of Graphs and Permutations
Vasquez, Roman Wesleyan College Edge Bootstrap Percolation of Paths in Various Host Graphs
Wachholz, Luke College of Saint Benedict & Saint John’s University Combinatorial Models for Sign Language Recognition: Graph Poses, Sequence Alignment, and Discrete Labeling
Walker, Shanise *** Clark Atlanta University The Pinnacle Sets of a Graph
Weber, Via *** Winston Salem State University Vertex Fault Tolerant Zero Forcing
Yang, Boting University of Regina Constrained Graph Searching Problems
Young, Michael *** Carnegie-Mellon University Defining Zero Forcing
Youngs, Zachary University of Minnesota Duluth G -Designs for the Connected Tripartite Unicyclic Graphs with Seven Edges
Zhang, Shunzhe University of Mississippi On the dual of Erdõs’ circuit spectrum problem
Zhao, Yingze University of Mississippi An extremal problem for minimally k-connected graphs
     
     
     
     
     
     
     
     
     
     
     
     
     
     
CGTC 56 (March, 2025) ABSTRACTS
Adeyemi, Morayo  Howard University New Occurrences of the Central Delannoy Numbers in Z2[x] and Related Generalized Second Order Lattice Path Set Moments
Akelbek, Mahmud Weber State University On the Convergence of Leslie Matrix by Using Scrambling Index
Adenew, Arsema  Howard University New Occurrences of the Central Delannoy Numbers in Z2[x] and Related Generalized Second Order Lattice Path Set Moments
Akinola, Fatima * University of Florida On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs
Balof, Barry Whitman College Selfish Sets, Posets, Tilings, and Bijections
Banegas, Daniel * University of Minnesota, Duluth Designs for Forests with Seven Edges
Beer, Jonathan Yeshiva University Crossing Spectrums for Polyomino Graphs
Bereg, Sergey The University of Texas at Dallas On van der Waerden numbers
Bickle, Allan Purdue University Intersecting Families of 3-sets
Bjorkman, Beth *** Air Force Research Laboratory Fragile Power Domination 
Blair, Howard Syracuse University Degree of Unsolvability of Arising from In nitary Choice
Bowling, Andrew Wabash College Zonal Labelings of Plane Graphs Using Arbitrary Abelian Groups
Brennan, Zachary *** Iowa State University Reversion probabilistic zero forcing: a discrete-time contact process
Brown, Jason Dalhousie University Graphical, Simplicial and Statistical Methods for Data Analysis, with an Application to Music
Cameron, Kathie Wilfrid Lauruer University Reconfiguration in Tournaments
Carlson, Josh *** Drake University Bridge Burning Cops and Robbers
Carr, John * University of North Alabama Designs of Variations of Conflict-Free-Colorings of Rectangular Lattices
Carrigan, Braxton Southern Connecticut State University Skolem number of Qn
Chalise, Parik * Johns Hopkins University Every tree on n edges decomposes Kn,n
Chatterjee, Ritabrato * Western Michigan University The Ramsey Index of a Graph
Choi, Sul-young Le Moyne College Strong coloring of hypercubes
Cruz Molina, Miguel University of Puerto Rico Rio Piedras. Some applications of our generalized HITS and link prediction algorithms to gene regulatory networks of Drosophila melanogaster flies reared in microgravity
Curbelo, Isreal R. Kean University Online interval coloring on short interval graphs and two-count interval graphs
Curran, Stephen University of Pittsburgh at Johnstown Pyramid Nim
Curtin, Brian University of South Florida A point-line incidence structure
da Silva, Poly H. Columbia University Constructing Intermediate Breakpoint Medians of Random Genomes
Davenport, Dennis Howard University Row Sums and Alternating Row Sums of Exponential Riordan Array
Delgado, Moises University of Puerto Rico Cayey An Extension of Our Bound on the Number of Absolutely Irreducible Factors of a Multivariate Polynomials
Denton, Abigail * Stetson University Primitive Star Decompositions of Complete Graphs
Doherty, Faun Washington & Jefferson College Characterization of 3-Foldable Words
Edmonds, Jack University of Waterloo Ray and Me
English, Sean UNC Wilmington Rational Exponents for Cliques
Fallat, Shaun *** University of Regina Minimum number of distinct eigenvalues of distance-regular and signed Johnson graphs
Feder, Schmuel Touro College Crossing Spectrums for Polyomino Graphs
Flagg, Mary *** University of St. Thomas Reconfiguration for Vertex Set Parameters
Freyberg, Bryan * University of Minnesota Duluth A New Labeling for Decomposing Complete Graphs into Bipartite Graphs
Gilroy, Haile McNeese State University/Auburn University On the Existence of Balanced Chain Rule Task Sets
Gismondi, Stephen * University of Guelph Ted's Polytope
Gnang, Edinah *** Johns Hopkins University A Proof of the Tree Packing Conjecture
Goedgebeur, Jan KU Leuven An introduction to computational graph theory and generation algorithms Part 1: Cubic graphs and snarks
Goedgebeur, Jan KU Leuven An introduction to computational graph theory and generation algorithms Part 2: Fullerenes and the House of Graphs
Gould, Ronald Emory University Extensions of the Chvátal-Erdös Theorem
Guan, Puhua University of Puerto Rico, Rio Piedras Strong coloring of hypercubes
Heath, Emily California State Polytechnic University An introduction to the Erdös–Gyárfás generalized Ramsey problem
Heath, Emily California State Polytechnic University The conflict-free hypergraph matching method and generalized Ramsey numbers
Heck, Melissa * University of Minnesota, Duluth Decomposing Complete Graphs into Unicyclic Tripartite Graphs with |E(G)| = 7 and 7 ≤ |V (G)| ≤ 8
Hernández Cruz, César  Universidad Nacional Autónoma de México Full H-colourings
Heuss, Sarah  USC Union Neighborhood Representatives
Higgins, Clayton * University of Minnesota, Duluth Decomposition of Complete Graphs Into Certain Unicyclic Bipartite Graphs With 7 Edges
Hong, Yujeong * University of Minnesota, Duluth Decomposing Complete Graphs into Unicyclic Tripartite Graphs with |E(G)| = 7 and 7 ≤ |V (G)| ≤ 8
Hunnell, Mark *** Winston-Salem State University Minimum Rank of Small Graphs
Jacob, Bonnie *** Rochester Institute of Technology When “wellness” meets zero forcing
Jacob, Jobby Rochester Institute of Technology Rankings and generalizations
Jent, Emma * Western Michigan University Multiple Monochromatic Subgraphs in Edge-Colored Graphs
Kingen, Sandra ** Brooklyn College and the Graduate Center, CUNY Pancyclicity of Almost-Planar Graphs
Kita, Nanao * Nagoya University Dulmage-Mendelsohn Decomposition for the Minimum Odd Join Problem in Bipartite Graphs
Koch, Johnathan *** Applied Research Solutions Fragile Power Domination II
Koch, Johnathan Applied Research Solutions The Power Domination Toolbox
Kreher, Donald Michigan Technological University Near-factorization of finite groups
Lee, Ashlyn Howard University (r,k)-Zebra Tree and Schr¨oder Paths
Lee, Jon University of Michigan On disjunction convex hulls by lifting
Low, Richard San Jose State University New Diagonal Ramsey Numbers of Even Cycles with Pendant Edges
Lozano Chávez, Humberto Universidad Nacional Autónoma de México Cops and robbers on token graphs of trees
McAdams, Stacey Louisiana Tech University Characterizing Critical Graphs for Oriented Book Embeddings
Merz, Sarah University of the Pacific Containment-intersection Graphs of Disks and Intervals
Messinger, Margaret-Ellen Mount Allison University A mixed-model for domination reconfiguration
Mihnea, Amalya Florida Memorial University Connecting Concepts to Develop New Methods of Deriving Combinatorial Formulas
Minyard, Mitchell Baylor University Limits and Periodicity of Metamour 2-Distance Graphs
Mukhopadhyay, Gourab University of Texas Rio Grande Valley Sums of cubes over odd-index q-Fibonacci numbers
Myers, Timothy Howard University Higher Order Lattice Path Set Moments and Central Delannoy Numbers
Nguendang, Philippe Howard University New Occurrences of the Central Delannoy Numbers in Z2[x] and Related Generalized Second Order Lattice Path Set Moments
Osborn, Sawyer Western Michgan Universityt From a Chessboard Problem to a Graph Coloring Problem
Pervin, Edward Aerospace and Defense A Petersen Graph construction of the Extended Ternary Golay Code
Pfaltz, John University of Virginia The Shape of Discrete Operator-closed Systems
Powell, Samuel Utah State University Fractional Vertex Cover Reliability of Graphs
Radziszowski, Stanislaw Rochester Institute of Technology Progress on Small and Large Ramsey Numbers
Ryan, Kathleen DeSales University Degree Sequences of Partial Halin Graphs
Schroeder, Michael * Stetson University Primitive C4 -decompositions of cocktail party graphs
Schuerger, Houston *** The University of Texas Permian Basin Cut-forcing: vertex cuts, matchings, and zero forcing variants
Schwartz, Andrew Southeast Missouri State University The Zero Forcing Numbers of Peony Graphs and Web Graphs
Seamone, Ben Dawson College & Université de Montréal Ramsey numbers of signed graphs
Sepanski, Mark * Baylor University Robinson–Schensted Shapes Arising From Cycle Decompositions
Sinko, Anne College of Saint Benedict and Saint John’s University   Gestalt-GNN: A Novel Approach to Enhnace AI Decision Interpretability
Soifer, Alexander University of Colorado Colorado Springs New results and old and new open problems and conjectures related to the chromatic number of the plane problem
Spencer, Joel New York University and Courant Institute Random Gems
Spencer, Joel New York University and Courant Institute Great Students!
Su, Hsin-hao Stonehill College On Subdivision Graphs of Cylinder Graphs which are 2-steps Hamiltonian II
Tidwell, David * Freed-Hareman University Double-Rainbow Paths, and their applications
Tiemeyer, Michael * Georgia Southern University On z-cycle factorizations with two associate classes where z is in {4, 4a} with even parameters
Tiner, Gary Faulkner University On the Loebl-Koml´os-S´os Conjecture for large spiders.
Wang, Shaohui Louisiana Christian University Domination and packing complexity of honeycomb networks
Wesley, William University of California, San Diego New bounds for some 3-color Ramsey numbers
Wierman, John Johns Hopkins University An Upper Bound for the Bond Percolation Threshold of the Face-Centered Cubic Lattice Via a Growth Process Approach
Wisby, Justin Florida International University Domination in Tensor Product of Path Graphs
Yang, Jiayu University of Idaho Uniquely Bi-embeddable Bipartite 2-regular Graphs
Young, Derek *** Mount Holyoke College Combinatorial Parameters for Cobipartite Graphs
Young, Michael *** Carnegie Mellon University The Relationship Between the Zero Forcing Number and Independence Number of Cubic Graphs
Zabel-Mena, Alec University of Puerto Rico Rio Piedras Absolute Irreducibility of Generalized Trinomials Defined by APN Functions of The Form f(x) = x3 + h(x) over Fs2
     
     

 

View Past Conference Abstracts