Pages that link to "Item:Q1354718"
From MaRDI portal
The following pages link to A bound on the strong chromatic index of a graph (Q1354718):
Displaying 50 items.
- Clique number of the square of a line graph (Q271628) (← links)
- Existence of rainbow matchings in strongly edge-colored graphs (Q294535) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- On strong list edge coloring of subcubic graphs (Q400392) (← 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 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)
- 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)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- Distance edge-colourings and matchings (Q714033) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Bounds for visual cryptography schemes (Q968192) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← 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 the list coloring version of Reed's conjecture (Q1689939) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← 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)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- Star edge-coloring of graphs with maximum degree four (Q2007679) (← 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)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs (Q2144507) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Edge-partition and star chromatic index (Q2335139) (← links)
- On a topological relaxation of a conjecture of Erdős and Nešetřil (Q2349967) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
