Locally homogeneous graphs from groups. - Andrew Vince (J. Graph Theory, 1981)

An algebraic theory of graph factorization. - Andrew Vince (Discret. Math., 1983)

Regular combinatorial maps. - Andrew Vince (J. Comb. Theory B, 1983)

Combinatorial maps. - Andrew Vince (J. Comb. Theory B, 1983)

A shellable poset that is not lexicographically shellable. - Andrew Vince; Michelle L. Wachs (Comb., 1985)

A Non-Shellable 3-Sphere. - Andrew Vince (Eur. J. Comb., 1985)

Strongly balanced graphs and random graphs. - Andrzej Rucinski 001; Andrew Vince (J. Graph Theory, 1986)

Balanced extensions of graphs and hypergraphs. - Andrzej Rucinski 001; Andrew Vince (Comb., 1988)

n-Graphs. - Andrew Vince (Discret. Math., 1988)

Star chromatic number. - Andrew Vince (J. Graph Theory, 1988)

Scheduling periodic events. - Andrew Vince (Discret. Appl. Math., 1989)

Discrete Jordan Curve Theorems. - Andrew Vince; Charles H. C. Little (J. Comb. Theory B, 1989)

Discrete mathematics for computing. - Andrew Vince; Clare A. Morris (Ellis Horwood, 1990)

Elementary Divisors of Graphs and Matroids. - Andrew Vince (Eur. J. Comb., 1991)

Dyck's map (3, 7)8 is a counterexample to a clique covering conjecture. - Andrew Vince; Steve Wilson (J. Comb. Theory B, 1992)

The classification of closed surfaces using colored graphs. - Andrew Vince (Graphs Comb., 1993)

The solution to an extremal problem on balanced extensions of graphs. - Andrzej Rucinski 001; Andrew Vince (J. Graph Theory, 1993)

Replicating Tessellations. - Andrew Vince (SIAM J. Discret. Math., 1993)

An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra. - Wei Z. Kitto; Andrew Vince; David Clifford Wilson (Discret. Appl. Math., 1994)

Nonrevisiting Paths on Surfaces. - H. Pulapaka; Andrew Vince (Discret. Comput. Geom., 1996)

Reconstruction of the set of branches of a graph. - Andrew Vince; Yongzhi Yang (Graphs Comb., 1996)

Non-revisiting paths on surfaces with low genus. - H. Pulapaka; Andrew Vince (Discret. Math., 1998)

Cycles in a graph whose lengths differ by one or two. - J. Adrian Bondy; Andrew Vince (J. Graph Theory, 1998)

On representations of some thickness-two graphs. - Joan P. Hutchinson; Thomas C. Shermer; Andrew Vince (Comput. Geom., 1999)

Isohedral Polyomino Tiling of the Plane. - Kevin Keating; Andrew Vince (Discret. Comput. Geom., 1999)

Self-Replicating Tiles and Their Boundary. - Andrew Vince (Discret. Comput. Geom., 1999)

Problem 10843. - Andrew Vince (Am. Math. Mon., 2000)

Almost Fixed Sets: 10843. - Andrew Vince; Kenneth Schilling (Am. Math. Mon., 2001)

A framework for the greedy algorithm. - Andrew Vince (Discret. Appl. Math., 2002)

Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families. - Mustafa Atici; Andrew Vince (Graphs Comb., 2002)

Separation index of a graph. - Andrew Vince (J. Graph Theory, 2002)

Topological Graph Theory. - Tomaz Pisanski; Primoz Potocnik; Jianer Chen; Jonathan L. Gross; Thomas W. Tucker; Andrew Vince; Dan Archdeacon; Seiya Negami; Arthur T. White (Handbook of Graph Theory, 2003)

Graph recurrence. - Andrew Vince (Eur. J. Comb., 2003)

The integrity of a cubic graph. - Andrew Vince (Discret. Appl. Math., 2004)

A Property of Normal Tilings. - Deniz Kazanci; Andrew Vince (Am. Math. Mon., 2004)

Parity Versions of 2-Connectedness. - Charles H. C. Little; Andrew Vince (Electron. J. Comb., 2006)

Indexing the aperture 3 hexagonal discrete global grid. - Andrew Vince (J. Vis. Commun. Image Represent., 2006)

Computing the Discrete Fourier Transform on a Hexagonal Lattice. - Andrew Vince; Xiqiang Zheng (J. Math. Imaging Vis., 2007)

Infinitely Many Trees Have Non-Sperner Subtree Poset. - Andrew Vince; Hua Wang (Order, 2007)

Discrete Lines and Wandering Paths. - Andrew Vince (SIAM J. Discret. Math., 2007)

Arithmetic and Fourier transform for the PYXIS multi-resolution digital Earth model. - Andrew Vince; Xiqiang Zheng (Int. J. Digit. Earth, 2009)

The average order of a subtree of a tree. - Andrew Vince; Hua Wang 003 (J. Comb. Theory B, 2010)

The Number of Ways to Assemble a Graph. - Andrew Vince; Miklós Bóna (Electron. J. Comb., 2012)

A Combinatorial Approach to Positional Number Systems - Andrew Vince (CoRR, 2012)

Fractal Tilings from Iterated Function Systems. - Michael F. Barnsley; Andrew Vince (Discret. Comput. Geom., 2014)

Approximation of rough functions. - Michael F. Barnsley; Brendan Harding; Andrew Vince; P. Viswanathan (J. Approx. Theory, 2016)

Symmetry in Sphere-Based Assembly Configuration Spaces. - Meera Sitharam; Andrew Vince; Menghan Wang; Miklós Bóna (Symmetry, 2016)

Counting connected sets and connected partitions of a graph. - Andrew Vince (Australas. J Comb., 2017)

Self-Similar Polygonal Tiling. - Michael F. Barnsley; Andrew Vince (Am. Math. Mon., 2017)

Aparallel digraphs and splicing machines. - Andrew Vince (Discret. Math., 2018)

Self-Similar Polygonal Tiling: extended abstract. - Andrew Vince; Michael F. Barnsley (Electron. Notes Discret. Math., 2018)

The average size of a connected vertex set of a k-connected graph. - Andrew Vince (Discret. Math., 2021)

The average size of a connected vertex set of a graph - Explicit formulas and open problems. - Andrew Vince (J. Graph Theory, 2021)

A lower bound on the average size of a connected vertex set of a graph. - Andrew Vince (J. Comb. Theory B, 2022)

An Extremal Graph Problem on a Grid and an Isoperimetric Problem for Polyominoes. - Andrew Vince (Electron. J. Comb., 2024)

Distortion Reversal in Aperiodic Tilings. - Louisa Barnsley; Michael F. Barnsley; Andrew Vince (Discret. Comput. Geom., 2024)