Extending precolorings to distinguish group actions

DOI10.1016/j.ejc.2018.03.008zbMath1390.05065arXiv1405.5558OpenAlexW2963750164WikidataQ129885884 ScholiaQ129885884MaRDI QIDQ1645056

Paul S. Wenger, Stephen G. Hartke, Michael Ferrara, Derrick Stolee, Ellen Gethner

Publication date: 28 June 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5558

zbMATH Keywords

chromatic numberprecoloring extension

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18)

Related Items (4)

Extending precolorings to distinguish group actions ⋮ List-distinguishing Cartesian products of cliques ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four

Cites Work

• Unnamed Item
• Unnamed Item
• List precoloring extension in planar graphs
• Distinguishing number and adjacency properties
• List-distinguishing colorings of graphs
• Extending precolourings of circular cliques
• On computing the distinguishing numbers of trees and forests
• The distinguishing chromatic number
• Destroying automorphisms by fixing nodes
• Distinguishability of locally finite trees
• Fixing numbers of graphs and groups
• On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
• Precoloring extension. I: Interval graphs
• You can't paint yourself into a corner
• Extending precolorings to distinguish group actions
• The distinguishing number of the hypercube
• Extending precolorings of subgraphs of locally planar graphs
• Distinguishing numbers for graphs and groups
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• Distinguishing number of countable homogeneous relational structures
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• Extending precolorings to circular colorings
• The maximum distinguishing number of a group
• The distinguishing number of the direct product and wreath product action.
• Distinguishing labellings of group action on vector spaces and graphs
• Extending Fractional Precolorings
• Distinguishing geometric graphs
• Precoloring extension forK₄-minor-free graphs
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• Graph colorings with local constraints -- a survey
• Precoloring Extension III: Classes of Perfect Graphs
• Precoloring Extensions of Brooks' Theorem
• Random Colourings and Automorphism Breaking in Locally Finite Graphs
• Distinguishing homomorphisms of infinite graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: Extending precolorings to distinguish group actions