On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
From MaRDI portal
Publication:3648500
DOI10.1137/07068686XzbMath1226.05210arXivmath/0703927MaRDI QIDQ3648500
Nikhil R. Devanur, V. Arvind, Christine T. Cheng
Publication date: 27 November 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0703927
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Extending precolorings to distinguish group actions ⋮ Distinguishing number of hierarchical products of graphs ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ List-distinguishing Cartesian products of cliques ⋮ On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ Symmetry breaking in planar and maximal outerplanar graphs ⋮ Distinguishing graphs by edge-colourings ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
This page was built for publication: On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
