The following pages link to (Q3320410):
Displaying 50 items.
- Strong edge coloring sparse graphs (Q324370) (← links)
- On strong list edge coloring of subcubic graphs (Q400392) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- Strong list edge coloring of subcubic graphs (Q460435) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- On \((s,t)\)-relaxed strong edge-coloring of graphs (Q511712) (← links)
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs (Q512620) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Strong edge-coloring for planar graphs with large girth (Q1625788) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
- On strong edge-coloring of graphs with maximum degree 4 (Q1682888) (← links)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- Generalized rainbow connection of graphs and their complements (Q1708384) (← links)
- List strong edge coloring of planar graphs with maximum degree 4 (Q1732781) (← links)
- A note on strong edge coloring of sparse graphs (Q1734962) (← links)
- On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable (Q1744746) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- Star edge-coloring of graphs with maximum degree four (Q2007679) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors (Q2094384) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- On strong edge-coloring of claw-free subcubic graphs (Q2117528) (← links)
- Strong edge coloring of circle graphs (Q2122690) (← links)
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs (Q2172399) (← links)
- Strong edge-coloring of cubic bipartite graphs: a counterexample (Q2172406) (← links)
- A characterization of well-indumatchable graphs having girth greater than seven (Q2172407) (← links)
- The strong chromatic index of graphs with edge weight eight (Q2185830) (← links)
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs (Q2198387) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- Variations on the Petersen colouring conjecture (Q2288171) (← links)
- The strong edge-coloring for graphs with small edge weight (Q2297732) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- Edge-partition and star chromatic index (Q2335139) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
