On detectable colorings of graphs

DOI10.21136/MB.2005.134214MaRDI QIDQ3426099zbMATH OpenOpenAlexFDO

Authors Henry Escuadro, Ping Zhang

Publication date 8 March 2007

Full work available at URL https://eudml.org/doc/226820, http://mb.math.cas.cz/mb130-4/

zbMATH Keywords

detection numberunicyclic graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5054146
• Extremal problems on detectable colorings of trees
• On detectable factorizations of regular graphs
• Extremal problems in detectable colorings of connected graphs with cycle rank 2
• The total detection numbers of graphs

Cited in

(6)

• Extremal problems in detectable colorings of connected graphs with cycle rank 2
• The total detection numbers of graphs
• Recognizable colorings of cycles and trees
• Recognizable colorings of graphs
• On detectable factorizations of regular graphs
• scientific article; zbMATH DE number 5054146 (Why is no real title available?)

This page was built for publication: On detectable colorings of graphs

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