Pages that link to "Item:Q5495056"
From MaRDI portal
The following pages link to Precise upper bound for the strong edge chromatic number of sparse planar graphs (Q5495056):
Displaying 18 items.
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← 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)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- Upper bound on 2-strong edge chromatic numbers of graphs (Q2923823) (← links)
- Strong edge-coloring of subcubic planar graphs (Q2966513) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Strong edge colorings of graphs and the covers of Kneser graphs (Q6081882) (← links)