On computing the distinguishing numbers of trees and forests
From MaRDI portal
Publication:813439
zbMath1080.05081MaRDI QIDQ813439
Publication date: 9 February 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125525
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Equitable distinguishing chromatic number ⋮ Extending precolorings to distinguish group actions ⋮ Distinguishing number of hierarchical products of graphs ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Trees with distinguishing number two ⋮ List-distinguishing Cartesian products of cliques ⋮ The distinguishing number of Cartesian products of complete graphs ⋮ Unnamed Item ⋮ Distinguishing graphs by edge-colourings ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ The distinguishing number of the augmented cube and hypercube powers ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Distinguishing index of Kronecker product of two graphs ⋮ On the local distinguishing chromatic number ⋮ On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results ⋮ On the distinguishing number of functigraphs
This page was built for publication: On computing the distinguishing numbers of trees and forests
