Pages that link to "Item:Q2573644"

The following pages link to \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644):

Displaying 27 items.

• 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)
• Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
• Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs (Q2686134) (← links)
• Local neighbor-distinguishing index of graphs (Q2693079) (← links)
• The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
• Not necessarily proper total colourings which are adjacent vertex distinguishing (Q2874310) (← links)
• Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
• A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) (← links)
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
• Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
• On the adjacent vertex distinguishing edge colourings of graphs (Q3568414) (← links)
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
• On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
• (Q5037994) (← links)
• AVD proper edge-coloring of some families of graphs (Q5042557) (← links)
• Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
• (Q5210481) (← links)
• On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) (← links)
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs (Q5963657) (← links)
• On the inclusion chromatic index of a graph (Q6055925) (← links)
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)
• Two-distance vertex-distinguishing index of sparse graphs (Q6611486) (← links)
• On the inclusion chromatic index of a Halin graph (Q6646393) (← links)