Pages that link to "Item:Q266908"

The following pages link to A note on adjacent vertex distinguishing colorings of graphs (Q266908):

Displayed 12 items.

• A note on vertex colorings of plane graphs (Q472144) ‎ (← links)
• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) ‎ (← links)
• Colourings of graphs by labellings (Q1687834) ‎ (← links)
• A note on additive choice number of planar graphs (Q2172418) ‎ (← links)
• Additive list coloring of planar graphs with given girth (Q2175242) ‎ (← links)
• On a total version of 1-2-3 conjecture (Q2194539) ‎ (← links)
• A lower bound and several exact results on the \(d\)-lucky number (Q2284776) ‎ (← links)
• Planar graphs with girth 20 are additively 3-choosable (Q2306581) ‎ (← links)
• The \(k\)-strong induced arboricity of a graph (Q2408964) ‎ (← links)
• AVD proper edge-coloring of some families of graphs (Q5042557) ‎ (← links)
• (Q5210481) ‎ (← links)
• Sum-distinguishing number of sparse hypergraphs (Q6171496) ‎ (← links)