Debra L. Boutin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2024

Determining number and cost of generalized Mycielskian graphsDebra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach. dmgt, 44(1):127, 2024. [doi]

2022

Paint cost and the frugal distinguishing numberDebra L. Boutin. adam, 6(2):2, November 2022. [doi]

Symmetry parameters of various hypercube familiesDebra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, Puck Rombach. adam, 6(2):2, November 2022. [doi]

2021

The cost of 2-distinguishing hypercubesDebra L. Boutin. DM, 344(9):112512, 2021. [doi]

Distinguishing orthogonality graphsDebra L. Boutin, Sally Cockburn. jgt, 98(3):389-404, 2021. [doi]

2019

Identifying codes on directed de Bruijn graphsDebra L. Boutin, Victoria Horan Goliber, Mikko Pelto. DAM, 262:29-41, 2019. [doi]

2014

Infinite Graphs with Finite 2-Distinguishing CostDebra L. Boutin, Wilfried Imrich. combinatorics, 21(4):4, 2014. [doi]

2013

The Cost of 2-Distinguishing Cartesian PowersDebra L. Boutin. combinatorics, 20(1):74, 2013. [doi]

2012

Posets of geometric graphsDebra L. Boutin, Sally Cockburn, Alice M. Dean, Andrei M. Margea. arsmc, 5(2):269-288, 2012. [doi]

Geometric graph homomorphismsDebra L. Boutin, Sally Cockburn. jgt, 69(2):97-113, 2012. [doi]

2011

More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic numberMichael O. Albertson, Debra L. Boutin, Ellen Gethner. arsmc, 4(1):5-24, 2011. [doi]

2010

The thickness and chromatic number of r-inflated graphsMichael O. Albertson, Debra L. Boutin, Ellen Gethner. DM, 310(20):2725-2734, 2010. [doi]

2009

Determining Sets, Resolving Sets, and the Exchange PropertyDebra L. Boutin. gc, 25(6):789-806, 2009. [doi]

The determining number of a Cartesian productDebra L. Boutin. jgt, 61(2):77-87, 2009. [doi]

2008

Automorphisms and Distinguishing Numbers of Geometric CliquesMichael O. Albertson, Debra L. Boutin. dcg, 39(4):778-785, 2008. [doi]

Small label classes in 2-distinguishing labelingsDebra L. Boutin. arsmc, 1(2):154-164, 2008. [doi]

Thickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin s graphsDebra L. Boutin, Ellen Gethner, Thom Sulanke. jgt, 57(3):198-214, 2008. [doi]

2007

Using Determining Sets to Distinguish Kneser GraphsMichael O. Albertson, Debra L. Boutin. combinatorics, 14(1), 2007. [doi]

2006

Distinguishing geometric graphsMichael O. Albertson, Debra L. Boutin. jgt, 53(2):135-150, 2006. [doi]

Identifying Graph Automorphisms Using Determining SetsDebra L. Boutin. combinatorics, 13(1), 2006. [doi]

2005

Isometrically Embedded GraphsDebra L. Boutin. arscom, 77, 2005.

1994

Lower bounds for constant degree independent setsMichael O. Albertson, Debra L. Boutin. DM, 127(1-3):15-21, 1994. [doi]

Sign in or sign up to see more results.

runs on WebDSL