Pages that link to "Item:Q1201255"
From MaRDI portal
The following pages link to The strong chromatic index of a cubic graph is at most 10 (Q1201255):
Displaying 50 items.
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Strong edge coloring sparse graphs (Q324370) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- On strong list edge coloring of subcubic graphs (Q400392) (← 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)
- Strong list edge coloring of subcubic graphs (Q460435) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← 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)
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 (Q519218) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- On induced matchings (Q687143) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← 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)
- A bound on the strong chromatic index of a graph (Q1354718) (← 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)
- Degenerate matchings and edge colorings (Q1706114) (← 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)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- Distance two edge labelings of lattices (Q1956249) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← 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)
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs (Q2144507) (← links)
- Strong edge-coloring of cubic bipartite graphs: a counterexample (Q2172406) (← links)
- List strong edge-coloring of graphs with maximum degree 4 (Q2174601) (← 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)
