scientific article; zbMATH DE number 5054146

MaRDI QIDQ5488328zbMATH OpenFDO

Authors Gary Chartrand, Henry Escuadro, Futaba Okamoto, Ping Zhang

Publication date 14 September 2006

zbMATH Keywords

detection number

Mathematics Subject Classification ID

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

Recommendations

• On detectable colorings of graphs
• Color-detectors of hypergraphs
• Recognizable colorings of graphs
• Distinguishing graphs by total colourings
• Distinguishing graphs by edge-colourings
• Graphs with vertex-coloring and detectable 2-edge-weighting
• Extremal problems in detectable colorings of connected graphs with cycle rank 2
• The coloring of graphs
• Color-induced graph colorings
• Color-induced graph colorings

Cited in

(15)

• On the total detection numbers of complete bipartite graphs
• Extremal problems in detectable colorings of connected graphs with cycle rank 2
• On detectable factorizations of cubic graphs
• On the hardness of determining the irregularity strength of graphs
• On detectable colorings of graphs
• Extremal problems on detectable colorings of trees
• Recognizable colorings of cycles and trees
• Recognizable colorings of graphs
• On detectable factorizations of regular graphs
• An upper bound on the distinguishing index of graphs with minimum degree at least two
• The total detection numbers of graphs
• Gap vertex-distinguishing edge colorings of graphs
• A code for disconnected edge-colored graphs
• A note on the total detection numbers of cycles
• Detection number of bipartite graphs and cubic graphs

This page was built for publication:

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