Extremal problems on detectable colorings of trees

DOI10.1016/J.DISC.2007.04.048zbMATH Open1151.05013OpenAlexW1978365346MaRDI QIDQ952656FDOQ952656

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Methods of destroying the symmetries of a graph
• Destroying automorphisms by fixing nodes
• Title not available (Why is that?)
• The irregular coloring number of a tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Point determination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On detectable factorizations of cubic graphs
• Line-critical point determining and point distinguishing graphs

Cited In (8)

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

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)