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):

Displayed 47 items.

• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) ‎ (← links)
• Neighbor sum distinguishing index (Q367074) ‎ (← links)
• On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) ‎ (← links)
• Algorithmic complexity of proper labeling problems (Q391137) ‎ (← links)
• Neighbor sum distinguishing index of planar graphs (Q396740) ‎ (← links)
• An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) ‎ (← links)
• The adjacent vertex distinguishing total chromatic number (Q442409) ‎ (← links)
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) ‎ (← 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)
• Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) ‎ (← links)
• Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) ‎ (← links)
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244) ‎ (← 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)
• On the neighbour-distinguishing index of a graph (Q855303) ‎ (← links)
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) ‎ (← links)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) ‎ (← links)
• General neighbour-distinguishing index via chromatic number (Q973148) ‎ (← links)
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) ‎ (← links)
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834) ‎ (← links)
• Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) ‎ (← links)
• A new type of edge-derived vertex coloring (Q1045165) ‎ (← links)
• Distant sum distinguishing index of graphs (Q2012525) ‎ (← links)
• Neighbor sum distinguishing index of subcubic graphs (Q2014224) ‎ (← links)
• Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs (Q2341729) ‎ (← 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)
• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs (Q2438328) ‎ (← links)
• General neighbour-distinguishing index of a graph (Q2470450) ‎ (← links)
• Distant set distinguishing total colourings of graphs (Q2629496) ‎ (← 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)
• 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)
• On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) ‎ (← links)
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) ‎ (← links)
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs (Q5963657) ‎ (← links)