Characterizations of regularity for certain $Q$-polynomial association schemes

Characterizations of Some Class of Formal Power Series via MÖbius Categories of Full Binomial Type

Characterizations of transversal and fundamental transversal matroids

Characterizing completely regular codes from an algebraic viewpoint

Characterizing Matchings as the Intersection of Matroids

Characterizing partition functions of the vertex model

Characterizing Sparse Graphs by Map Decompositions

Characters of symmetric groups in terms of free cumulants and Frobenius coordinates

Chebyshev type lattice path weight polynomials by a constant term method

Chemical trees minimizing energy and Hosoya index

Chessboard complexes indomitable

Chio Condensation and Random Sign Matrices

Chip-Firing and Riemann-Roch Theory for Directed Graphs

Chip-Firing and Rotor-Routing on Directed Graphs

Chip-Firing Games, $G$-Parking Functions, and an Efficient Bijective Proof of the Matrix-Tree Theorem

Chip-firing games, potential theory on graphs, and spanning trees

Chirality Groups of Maps and Hypermaps

Choice Number and Energy of Graphs

Choice-memory tradeoff in allocations

Chomp on Graphs and Subsets