Pages that link to "Item:Q2422742"
From MaRDI portal
The following pages link to On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742):
Displaying 8 items.
- On the complexity of the flow coloring problem (Q499367) (← links)
- A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481) (← links)
- Some results on the 3-total-rainbow index (Q2141205) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Extremal stretch of proper-walk coloring of graphs (Q2243237) (← links)
- (Q4414494) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
- Relations of three classes of disconnected coloring (Q6153478) (← links)