Pages that link to "Item:Q987498"

The following pages link to Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498):

Displayed 41 items.

• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) ‎ (← links)
• Neighbor sum distinguishing index of planar graphs (Q396740) ‎ (← links)
• An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) ‎ (← links)
• Minimum number of disjoint linear forests covering a planar graph (Q405685) ‎ (← links)
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) ‎ (← links)
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739) ‎ (← links)
• Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) ‎ (← links)
• Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) ‎ (← links)
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244) ‎ (← links)
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756) ‎ (← links)
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516) ‎ (← links)
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) ‎ (← links)
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) ‎ (← links)
• Neighbor-sum-distinguishing edge choosability of subcubic graphs (Q1680485) ‎ (← links)
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) ‎ (← links)
• Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) ‎ (← links)
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) ‎ (← links)
• A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) ‎ (← links)
• Distant sum distinguishing index of graphs (Q2012525) ‎ (← links)
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) ‎ (← links)
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285) ‎ (← links)
• Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) ‎ (← links)
• Neighbor sum distinguishing index of sparse graphs (Q2194737) ‎ (← links)
• Some bounds on the neighbor-distinguishing index of graphs (Q2352066) ‎ (← links)
• Edge colorings of the direct product of two graphs (Q2354610) ‎ (← links)
• Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) ‎ (← links)
• \(d\)-strong edge colorings of graphs (Q2441359) ‎ (← links)
• Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) ‎ (← links)
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) ‎ (← links)
• Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) ‎ (← links)
• The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) ‎ (← links)
• (Q2857387) ‎ (← links)
• A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) ‎ (← links)
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) ‎ (← links)
• On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) ‎ (← links)
• (Q5037994) ‎ (← links)
• The linear 2-arboricity of sparse graphs (Q5370820) ‎ (← links)
• On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) ‎ (← links)
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) ‎ (← links)
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs (Q5963657) ‎ (← links)
• On the inclusion chromatic index of a graph (Q6055925) ‎ (← links)