2025
Intersecting Families of Spanning Trees, Nathan Lindzey
Delta-modular matroids, Zachary Walsh
2024
Vertex Contraction-Deletion Minors, Sarah Allred
A general theorem in spectral extremal graph theory, Dheer Noal Desai
On the non-existence of some Moore Cayley digraphs, Alexander Gavrilyuk
An Ore-type condition for hamiltonicity in tough graphs and the extremal examples, Songling Shan
Paradoxical Decompositions and Colouring Rules, Robert Simon
Loose elements and paving matroids, Jagdeep Singh
Phase transitions in isoperimetric problems, Chris Wells
Chords of longest cycles passing through a specified small set, Shunzhe Zhang
The Strong Edge-Coloring of Graphs, Xiangqian Zhou
2023
On the coequal values of total chromatic number and chromatic index, Guantao Chen
Neumaier graphs, Maarten De Boeck
The Independent Bondage Number of Planar Graphs with Degree Conditions and Girth Conditions, Kanchana Gamladdalage
Some generalizations of the class of spikes, Kevin Grace
Chromatic Number and Independence Number of Cayley Graphs on Abelian Groups, John Griesmer
Hereditary Nordhaus-Gaddum graphs, Vaidyanathan Sivaraman
Saturation Numbers of Double Stars, Lei Zhong
2019
The Goldberg-Seymour Conjecture, Guantao Chen
Forbidden induced subgraphs for threshold-like graph classes, Vaidyanathan Sivaraman
2018
Multicolor Gallai-Ramsey Numbers of Cycles and Paths, Zixia Song
2017
Quasi-surfaces: Chromatic Numbers and Euler’s Formula, Jinko Kanno
New Results on the Integral Sum Graphs, Haiying Wang
2016
Quadrilateral embeddings of cartesian product graphs, Mark Ellingham
A Zero-Sum Conjecture of Hamidoune, David Grynkiewicz
On the signless Laplacian eigenvalues related to independence number of graphs, Huiqing Liu
r-hued chromatic number of P_t-free graphs, Xuezheng Lv
The chain theorem of 4-connected graphs, Chengfu Qin
Some Extremal Problems of Graphs and Hypergraphs, Yongtang Shi
2015
Subtending many angles with few points, Paul Balister
Automorphism groups of codes, Ted Dobson
On Chorded Cycles, Ron Gould
Eigenvalues and Spanning Tree Packing of Graphs, Hong-Jian Lai
Additive bases in groups, Thai Hoang Le
Fractional matchings of graphs, Suil O
Clones in Matroids, James Reid
Moore Graphs of Diameter two: The Homan-Singleton Problem, William Staton
On Reliable Broadcast in Low Duty-Cycle Wireless Sensor Networks, Feng Wang
Unimodal f-vectors and h-vectors of trees, Russ Woodroofe
Fractional Chromatic Number of Random Subgraphs, Hehui Wu
Hamiltonian-Connected Line Graphs with Given Degree Sums, Aimei Yu
Thickness and outerthickness of graphs embedded in surfaces, Xiaoya Zha
Fundamental Graphs for Binary Matroids, Xiangqian Zhou
2014
The Robber Locating Game, Richard Johnson
On a conjecture of Leader and Radcliffe related to the Littlewood-Offord problem, Tomas Juskevicius
Digraph Coloring and Forbidden Cycle, Jie Ma
Some analytic methods for hypergraphs, Vladimir Nikiforov
The Matroids Without a Small Minor, James Reid
Combinatorial search and separating families, Dominik Vu
Characterizing 3-connected binary matroids with no P9-minor, Haidong Wu
Triangle-free subgraph with high fractional chromatic number, Hehui Wu
Decomposing cubic graphs with low genus, Dong Ye
2013
On Excluded and Unavoidable Minors in Graphs, Stan Dziobiak
Hamiltonian cycles through a given edge of more than 1-tough chordal planar graphs, John Estes
Genus and Other Graph Invariants, Jinko Kanno
Amalgamations and Hamilton Decompositions, Chris Rodger
Math at the National Institute of Standards and Technology, James Shook
k-Trees, k-Frames, Shells and Independence Polynomials, William Staton
Multiplicative Zagreb indices of k-trees, Shaohui Wang
2012
On Regular and Binary Matroids Without Small Minors, Kayla Davis Harville
Complete tripartite graphs and their competition numbers, Jaromy Kuhl
Degree sum condition for k-ordered hamiltonian connected graphs, Emlee Nicholson
Well-covered k-trees, k-frames, and unique colorability, Wanda Payne
Longest Cycles in Graphs with Given Independence Number and Connectivity, Hehui Wu
Nearly Tight Linear Programming Bounds for Demand Matching in Bipartite Graphs, Hehui Wu
2011
How Many Holes Can an Unbordered Partial Word Contain?, Cameron Byrum
3-Connected Graph of Path-Width at Most Three, Stan Dziobiak
Using Mathematica for Graph Theoretical Computations, Stan Dziobiak
Linked Graph with Modular Constraints, Zhiquan Hu
On a class of matroid designs, James Reid
Affiliation Networks, James Shook
On Finding a Minimum Toughness Condition for a k-Tree to be Hamiltonian, James Shook
2010
Long Cycles in 3-Connected Graphs with Bounded Degrees, Guantao Chen
On triangle-free 3-connected matroids, Manoel Lemos
Some results on path-factors in graphs, Xiaojuan Li
Lower Bounds of Edge Critical Graphs, Xuechao Li
Domination and Independent Domination in Graphs, Bruce Priddy
2009
On compact edge-colorings : a polynomial time reduction from k-linear to k-cyclic, Sivan Altinakar
A chain theorem for internally 4-connected matroids, Carolyn Chun
Deletion-Contraction Polynomials, Deborah Chun
Cycles and subsets of vertices in graphs, Hao Li
On minimally k-connected matroids, James Reid
A Comparison of Zero Divisor Graphs, Sandra Spiroff
On the shell of some graphs, William Staton
Clones in representable matroids over a finite field, Xiangqian Zhou
2008
On Circuit Sizes of Binary Matroids, James Reid
A characterization of the Centers of Chordal Graphs, James Shook
Signed Graphs and Their Matroids, Xianqian Zhou
2007
Non-separating co-circuits in 3-connected binary matroids, Haidong Wu
2005
Decoding of Huffman codes with self-synchronization strings, Lei Cao
Every 6-connected line graph is hamiltonian, Hongjian Lai
Clones in Representable Matroids, James Reid
Recent Results on Clones in Matroids, James Reid
Ramsey Unsaturated and Saturated Graphs, R. H. Schelp
2004
Plane Graphs with Positive Curvature, Guantao Chen
Triads in 3-connected Matroids, Manoel Lemos
Recent Results and Problems in General Randic Index, Xueliang Li
Trees with Maximum General Randic Index, Xueliang Li
An Introduction to Cycle Double Cover Conjecture, Klas Markström
The Cycle Double Cover Conjecture II, Klas Markström