Extremal problems on detectable colorings of trees

DOI10.1016/J.DISC.2007.04.048MaRDI QIDQ952656zbMATHOpenAlexFDO

Authors 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) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On an extremal problem for colored trees
• Extremal problems for colored trees and Davenport-Schinzel sequences
• Extremal \(H\)-colorings of trees and 2-connected graphs
• Extremal problems in detectable colorings of connected graphs with cycle rank 2
• Tree-coloring problems of bounded treewidth graphs
• Maximizing and minimizing the number of generalized colorings of trees
• Extremal trees with respect to number of (A, B, 2 C)-edge colourings
• Extremal graphs in some coloring problems
• scientific article; zbMATH DE number 5054146
• On the dominator colorings in trees

Cites work

• scientific article; zbMATH DE number 140040 (Why is no real title available?)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• scientific article; zbMATH DE number 841572 (Why is no real title available?)
• scientific article; zbMATH DE number 3895095 (Why is no real title available?)
• scientific article; zbMATH DE number 5054146 (Why is no real title available?)
• Destroying automorphisms by fixing nodes
• Line-critical point determining and point distinguishing graphs
• Methods of destroying the symmetries of a graph
• On detectable factorizations of cubic graphs
• Point determination in graphs
• The irregular coloring number of a tree

Cited in

(9)

• On the total detection numbers of complete bipartite graphs
• Extremal problems in detectable colorings of connected graphs with cycle rank 2
• Vertex identification in trees
• On an extremal problem for colored trees
• On detectable colorings of graphs
• Recognizable colorings of cycles and trees
• Recognizable colorings of graphs
• The total detection numbers of graphs
• Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952656)