scientific article; zbMATH DE number 5054146
From MaRDI portal
Publication:5488328
zbMATH Open1102.05020MaRDI QIDQ5488328FDOQ5488328
Authors: Gary Chartrand, Henry Escuadro, Futaba Okamoto, Ping Zhang 
Publication date: 14 September 2006
Title of this publication is not available (Why is that?)
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
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (14)
- On the total detection numbers of complete bipartite graphs
- Recognizable colorings of graphs
- An upper bound on the distinguishing index of graphs with minimum degree at least two
- Recognizable colorings of cycles and trees
- Extremal problems in detectable colorings of connected graphs with cycle rank 2
- A note on the total detection numbers of cycles
- Gap vertex-distinguishing edge colorings of graphs
- The total detection numbers of graphs
- Extremal problems on detectable colorings of trees
- On detectable factorizations of regular graphs
- A code for disconnected edge-colored graphs
- On detectable factorizations of cubic graphs
- On detectable colorings of graphs
- On the hardness of determining the irregularity strength of 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)
