Pages that link to "Item:Q856841"

The following pages link to \(r\)-strong edge colorings of graphs (Q856841):

Displaying 48 items.

• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← links)
• Neighbor sum distinguishing index (Q367074) (← links)
• Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
• On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
• Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
• An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) (← links)
• Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
• Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756) (← links)
• 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← 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)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) (← 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 sum distinguishing index of 2-degenerate graphs (Q1680491) (← links)
• Distant set distinguishing edge colourings of graphs (Q1686263) (← 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)
• Neighbor sum distinguishing index of subcubic graphs (Q2014224) (← links)
• On the neighbor-distinguishing indices of planar graphs (Q2117565) (← 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)
• 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)
• Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) (← links)
• Edge-partitions of graphs and their neighbor-distinguishing index (Q2404402) (← links)
• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs (Q2438328) (← links)
• \(d\)-strong edge colorings of graphs (Q2441359) (← links)
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← 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)
• Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
• On generalisations of the AVD conjecture to digraphs (Q2657104) (← 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)
• (Q2857387) (← links)
• Not necessarily proper total colourings which are adjacent vertex distinguishing (Q2874310) (← links)
• On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
• On the inclusion chromatic index of a graph (Q6055925) (← links)