scientific article; zbMATH DE number 5174935
From MaRDI portal
Publication:5294976
zbMath1131.05045MaRDI QIDQ5294976
Bing Yao, Hui Cheng, Jing-wen Li, Zhong Fu Zhang, Xiang'en Chen
Publication date: 26 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound ⋮ Distant set distinguishing edge colourings of graphs ⋮ \(d\)-strong edge colorings of graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ A characterization of graphs with regular distance-2 graphs
This page was built for publication: