Recognizable colorings of graphs

DOI10.7151/DMGT.1390MaRDI QIDQ3527525zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, Linda Lesniak, Donald W. Vanderjagt, Ping Zhang

Publication date 29 September 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/db570ff839e883cffeaa3b6cd1dbc405262c337f

zbMATH Keywords

recognition numberrecognizable coloring

Mathematics Subject Classification ID

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

Recommendations

• Recognizable colorings of cycles and trees
• scientific article; zbMATH DE number 5054146
• On detectable colorings of graphs
• Extremal problems on detectable colorings of trees
• scientific article; zbMATH DE number 5302772

Cited in

(10)

• Neighborhood distinguishing coloring in graphs
• The singular chromatic number of a graph.
• A code for disconnected edge-colored graphs
• Recognizable colorings of cycles and trees
• scientific article; zbMATH DE number 4123760 (Why is no real title available?)
• A proof of a conjecture on multiset coloring the powers of cycles
• Vertex identification in trees
• scientific article; zbMATH DE number 5054146 (Why is no real title available?)
• Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
• Recognizable coloring of graphs

This page was built for publication: Recognizable colorings of graphs

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