Pages that link to "Item:Q318921"
From MaRDI portal
The following pages link to The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921):
Displaying 13 items.
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- (Q393362) (redirect page) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- The strong chromatic index of sparse graphs (Q477679) (← links)
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- On incidence choosability of cubic graphs (Q1999751) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- Strong chromatic index in subset graphs (Q2713611) (← links)
- On the equitable vertex arboricity of complete tripartite graphs (Q2788734) (← links)