default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Vince
- > Home > Persons > Andrew Vince
Publications
- 2024
[j53]Andrew Vince:
An Extremal Graph Problem on a Grid and an Isoperimetric Problem for Polyominoes. Electron. J. Comb. 31(2) (2024)- 2022
- [j51]Andrew Vince
:
A lower bound on the average size of a connected vertex set of a graph. J. Comb. Theory B 152: 153-170 (2022) - 2021
- [j50]Andrew Vince:
The average size of a connected vertex set of a k-connected graph. Discret. Math. 344(10): 112523 (2021) - [j49]Andrew Vince:
The average size of a connected vertex set of a graph - Explicit formulas and open problems. J. Graph Theory 97(1): 82-103 (2021) - 2018
- [j48]Andrew Vince:
Aparallel digraphs and splicing machines. Discret. Math. 341(10): 2883-2893 (2018) - 2017
- [j46]Andrew Vince:
Counting connected sets and connected partitions of a graph. Australas. J Comb. 67: 281-293 (2017) - 2012
- [i1]Andrew Vince:
A Combinatorial Approach to Positional Number Systems. CoRR abs/1205.6460 (2012) - 2007
- [j36]Andrew Vince:
Discrete Lines and Wandering Paths. SIAM J. Discret. Math. 21(3): 647-661 (2007) - 2006
- [j34]Andrew Vince:
Indexing the aperture 3 hexagonal discrete global grid. J. Vis. Commun. Image Represent. 17(6): 1227-1236 (2006) - 2004
- [j33]Andrew Vince:
The integrity of a cubic graph. Discret. Appl. Math. 140(1-3): 223-239 (2004) - 2003
- [j31]Andrew Vince:
Graph recurrence. Eur. J. Comb. 24(1): 15-32 (2003) - 2002
- [j30]Andrew Vince:
A framework for the greedy algorithm. Discret. Appl. Math. 121(1-3): 247-260 (2002) - [j28]Andrew Vince:
Separation index of a graph. J. Graph Theory 41(1): 53-61 (2002) - 2000
- [j26]Andrew Vince:
Problem 10843. Am. Math. Mon. 107(10): 951 (2000) - 1999
- [j24]Andrew Vince:
Self-Replicating Tiles and Their Boundary. Discret. Comput. Geom. 21(3): 463-476 (1999) - 1993
- [j17]Andrew Vince:
The classification of closed surfaces using colored graphs. Graphs Comb. 9(1): 75-84 (1993) - [j15]Andrew Vince:
Replicating Tessellations. SIAM J. Discret. Math. 6(3): 501-521 (1993) - 1991
- [j13]Andrew Vince:
Elementary Divisors of Graphs and Matroids. Eur. J. Comb. 12(5): 445-453 (1991) - 1989
- [j12]Andrew Vince:
Scheduling periodic events. Discret. Appl. Math. 25(3): 299-310 (1989) - 1988
- [j9]Andrew Vince:
n-Graphs. Discret. Math. 72(1-3): 367-380 (1988) - [j8]Andrew Vince:
Star chromatic number. J. Graph Theory 12(4): 551-559 (1988) - 1985
- [j5]Andrew Vince:
A Non-Shellable 3-Sphere. Eur. J. Comb. 6(1): 91-100 (1985) - 1983
- [j4]Andrew Vince:
An algebraic theory of graph factorization. Discret. Math. 46(2): 211-213 (1983) - [j3]Andrew Vince:
Combinatorial maps. J. Comb. Theory B 34(1): 1-21 (1983) - [j2]Andrew Vince:
Regular combinatorial maps. J. Comb. Theory B 35(3): 256-277 (1983) - 1981
- [j1]Andrew Vince:
Locally homogeneous graphs from groups. J. Graph Theory 5(4): 417-422 (1981)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
