Pages that link to "Item:Q1926059"
From MaRDI portal
The following pages link to Upper bounds for the rainbow connection numbers of line graphs (Q1926059):
Displaying 6 items.
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- The rainbow connection number of the power graph of a finite group (Q2631090) (← links)
- Strong rainbow connection numbers of toroidal meshes (Q4554570) (← links)