Extending precolorings to distinguish group actions
Authors:
- Michael FerraraMFMichael Ferrara
- Ellen GethnerEGEllen Gethner
- Stephen G. HartkeSHStephen G. Hartke
- Derrick StoleeDSDerrick Stolee
- Paul S. WengerPWPaul S. Wenger
- 1 August 2018
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 72, 12-28
Abstract
No abstract availableAll Related Versions
Funding Information
- Simons Foundation (206692, 426971)
- Simons Foundation (311772)
- National Science Foundation (DMS-0914815)
This publication has 33 references indexed in Scilit:
- List precoloring extension in planar graphsDiscrete Mathematics, 2011
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting ApproachSIAM Journal on Discrete Mathematics, 2008
- Extending precolorings to circular coloringsJournal of Combinatorial Theory, Series B, 2006
- Distinguishing geometric graphsJournal of Graph Theory, 2006
- Distinguishing Cartesian Powers of GraphsThe Electronic Journal of Combinatorics, 2005
- Extending precolorings of subgraphs of locally planar graphsEuropean Journal of Combinatorics, 2004
- Precoloring Extensions of Brooks' TheoremSIAM Journal on Discrete Mathematics, 2004
- You Can't Paint Yourself into a CornerJournal of Combinatorial Theory, Series B, 1998
- Symmetry Breaking in GraphsThe Electronic Journal of Combinatorics, 1996
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 1992