Extremal problems on detectable colorings of trees

DOI10.1016/j.disc.2007.04.048zbMath1151.05013OpenAlexW1978365346MaRDI QIDQ952656

Henry Escuadro, Ping Zhang

Publication date: 12 November 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.048

zbMATH Keywords

treedetection numberdetectable coloring

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Destroying automorphisms by fixing nodes
• Line-critical point determining and point distinguishing graphs
• Methods of destroying the symmetries of a graph
• The irregular coloring number of a tree
• Point determination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal problems on detectable colorings of trees