The following pages link to (Q5752590):
Displaying 50 items.
- Clique number of the square of a line graph (Q271628) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Strong edge coloring sparse graphs (Q324370) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- The strong chromatic index of sparse graphs (Q477679) (← 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)
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 (Q519218) (← links)
- Cliques in \(C_4\)-free graphs of large minimum degree (Q524175) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- \(r\)-strong edge colorings of graphs (Q856841) (← links)
- The strong chromatic index of a class of graphs (Q998363) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← links)
- Incidence and strong edge colorings of graphs (Q1313849) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Strong edge-coloring for planar graphs with large girth (Q1625788) (← links)
- Induced and weak induced arboricities (Q1625812) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← 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)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- List star edge coloring of sparse graphs (Q1701121) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- List strong edge coloring of planar graphs with maximum degree 4 (Q1732781) (← links)
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable (Q1744746) (← links)
- List star chromatic index of sparse graphs (Q1752653) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Strong edge colorings of uniform graphs (Q1887640) (← links)
- Distance two edge labelings of lattices (Q1956249) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- On incidence choosability of cubic graphs (Q1999751) (← links)
- Injective edge-coloring of graphs with given maximum degree (Q2033899) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- List star edge coloring of generalized Halin graphs (Q2092427) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
