Pages that link to "Item:Q274688"
From MaRDI portal
The following pages link to Hardness results for total rainbow connection of graphs (Q274688):
Displaying 8 items.
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- Some results on the 3-total-rainbow index (Q2141205) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- Hardness and Algorithms for Rainbow Connectivity (Q5389981) (← links)