default search action
Art S. Finbow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j19]Arthur S. Finbow
, Bert L. Hartnell
A characterization of well-indumatchable graphs having girth greater than seven. Discret. Appl. Math. 321: 261-271 (2022) - 2020
- [j18]Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
On the structure of 4-regular planar well-covered graphs. Discret. Appl. Math. 283: 655-688 (2020)
2010 – 2019
- 2017
- [j17]Arthur S. Finbow
On well-covered pentagonalizations of the plane. Discret. Appl. Math. 224: 91-105 (2017) - 2016
- [j16]Arthur S. Finbow
Well-covered triangulations: Part IV. Discret. Appl. Math. 215: 71-94 (2016) - 2010
- [j15]Arthur S. Finbow
On well-covered triangulations: Part III. Discret. Appl. Math. 158(8): 894-912 (2010) - [j14]Arthur S. Finbow
On the packing chromatic number of some lattices. Discret. Appl. Math. 158(12): 1224-1228 (2010)
2000 – 2009
- 2009
- [j13]Art S. Finbow
On well-covered triangulations: Part II. Discret. Appl. Math. 157(13): 2799-2817 (2009) - 2008
- [j12]Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt
Open irredundance and maximum degree in graphs. Discret. Math. 308(23): 5358-5375 (2008) - [j11]Douglas F. Rall
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. Electron. Notes Discret. Math. 30: 57-61 (2008) - 2005
- [j10]Art S. Finbow:
A lower bound for the CO-irredundance number of a graph. Discret. Math. 295(1-3): 49-62 (2005) - 2004
- [j9]Art S. Finbow
Well-located graphs: a collection of well-covered ones. Discret. Math. 276(1-3): 201-209 (2004) - [j8]Ernest J. Cockayne, Art Stephen Finbow:
Generalised irredundance in graphs: Nordhaus-Gaddum bounds. Discuss. Math. Graph Theory 24(1): 147-160 (2004) - 2003
- [j7]Art S. Finbow
On well-covered triangulations: Part I. Discret. Appl. Math. 132(1-3): 97-108 (2003) - 2000
- [j6]Art S. Finbow
Well-located graphs: A collection of well-covered ones. Electron. Notes Discret. Math. 5: 120-122 (2000)
1990 – 1999
- 1995
- [j5]Art S. Finbow, Bert L. Hartnell:
A characterization of parity graphs containing no cycle of order five or less. Ars Comb. 40 (1995) - 1994
- [j4]Art S. Finbow
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. Discret. Math. 125(1-3): 153-167 (1994) - [j3]Art Stephen Finbow
A characterization of well-covered graphs that contain neither 4- nor 5-cycles. J. Graph Theory 18(7): 713-721 (1994) - 1993
- [j2]Art S. Finbow
A Characterization of Well Covered Graphs of Girth 5 or Greater. J. Comb. Theory B 57(1): 44-68 (1993)
1980 – 1989
- 1989
- [j1]Art S. Finbow
On designing a network to defend against random attacks of radius two. Networks 19(7): 771-792 (1989)
Coauthor Index
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 20:25 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: