The following pages link to Strong edge colorings of graphs (Q1126183):
Displaying 46 items.
- Strong edge coloring sparse graphs (Q324370) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← 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)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- \(r\)-strong edge colorings of graphs (Q856841) (← links)
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs (Q931507) (← links)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905) (← links)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- On the vertex-distinguishing proper edge-colorings of graphs (Q1305536) (← links)
- Incidence and strong edge colorings of graphs (Q1313849) (← links)
- Balanced edge colorings. (Q1425105) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Maximal edge-colorings of graphs (Q1696530) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Strong edge colorings of uniform graphs (Q1887640) (← links)
- Strong edge coloring of circle graphs (Q2122690) (← links)
- Strong edge-coloring of cubic bipartite graphs: a counterexample (Q2172406) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- The strong edge-coloring for graphs with small edge weight (Q2297732) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- Kaleidoscopic colorings of graphs (Q2364091) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- \(d\)-strong edge colorings of graphs (Q2441359) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← links)
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
- The strong pseudoachromatic number of a graph (Q2811807) (← links)
- Weak-odd edge-coloring of digraphs (Q2829873) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five (Q2857387) (← links)
- (Q3023237) (← links)
- Strong chromatic index of subset graphs (Q3122901) (← links)
- (Q3320410) (← links)
- (Q3421917) (← links)
- The strong chromatic number of a graph (Q3989737) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- Strong k-colourings of graphs (Q4809513) (← links)
- STRONG COLORINGS OVER PARTITIONS (Q5009680) (← links)
- (Q5318874) (← links)
- On strongly spanning k-edge-colorable subgraphs (Q5737974) (← links)
- Strong edge-coloring of planar graphs (Q5920291) (← links)
