default search action
Debra L. Boutin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Debra L. Boutin
, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach:
Determining number and cost of generalized Mycielskian graphs. Discuss. Math. Graph Theory 44(1): 127 (2024) - 2022
- [j21]Debra L. Boutin:
Paint cost and the frugal distinguishing number. Art Discret. Appl. Math. 6(2): 2 (2022) - [j20]Debra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, Puck Rombach:
Symmetry parameters of various hypercube families. Art Discret. Appl. Math. 6(2): 2 (2022) - 2021
- [j19]Debra L. Boutin
The cost of 2-distinguishing hypercubes. Discret. Math. 344(9): 112512 (2021) - [j18]Debra L. Boutin
Distinguishing orthogonality graphs. J. Graph Theory 98(3): 389-404 (2021)
2010 – 2019
- 2019
- [j17]Debra L. Boutin, Victoria Horan Goliber, Mikko Pelto:
Identifying codes on directed de Bruijn graphs. Discret. Appl. Math. 262: 29-41 (2019) - 2014
- [j16]Debra L. Boutin, Wilfried Imrich:
Infinite Graphs with Finite 2-Distinguishing Cost. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j15]Debra L. Boutin:
The Cost of 2-Distinguishing Cartesian Powers. Electron. J. Comb. 20(1): 74 (2013) - 2012
- [j14]Debra L. Boutin, Sally Cockburn, Alice M. Dean, Andrei M. Margea:
Posets of geometric graphs. Ars Math. Contemp. 5(2): 269-288 (2012) - [j13]Debra L. Boutin, Sally Cockburn:
Geometric graph homomorphisms. J. Graph Theory 69(2): 97-113 (2012) - 2011
- [j12]Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. Ars Math. Contemp. 4(1): 5-24 (2011) - 2010
- [j11]Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
The thickness and chromatic number of r-inflated graphs. Discret. Math. 310(20): 2725-2734 (2010)
2000 – 2009
- 2009
- [j10]Debra L. Boutin:
Determining Sets, Resolving Sets, and the Exchange Property. Graphs Comb. 25(6): 789-806 (2009) - [j9]Debra L. Boutin:
The determining number of a Cartesian product. J. Graph Theory 61(2): 77-87 (2009) - 2008
- [j8]Debra L. Boutin:
Small label classes in 2-distinguishing labelings. Ars Math. Contemp. 1(2): 154-164 (2008) - [j7]Michael O. Albertson, Debra L. Boutin:
Automorphisms and Distinguishing Numbers of Geometric Cliques. Discret. Comput. Geom. 39(4): 778-785 (2008) - [j6]Debra L. Boutin, Ellen Gethner, Thom Sulanke:
Thickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin's graphs. J. Graph Theory 57(3): 198-214 (2008) - 2007
- [j5]Michael O. Albertson, Debra L. Boutin:
Using Determining Sets to Distinguish Kneser Graphs. Electron. J. Comb. 14(1) (2007) - 2006
- [j4]Debra L. Boutin:
Identifying Graph Automorphisms Using Determining Sets. Electron. J. Comb. 13(1) (2006) - [j3]Michael O. Albertson, Debra L. Boutin:
Distinguishing geometric graphs. J. Graph Theory 53(2): 135-150 (2006) - 2005
- [j2]Debra L. Boutin:
Isometrically Embedded Graphs. Ars Comb. 77 (2005)
1990 – 1999
- 1994
- [j1]Michael O. Albertson, Debra L. Boutin:
Lower bounds for constant degree independent sets. Discret. Math. 127(1-3): 15-21 (1994)
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-07-20 20:34 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: