Pages that link to "Item:Q494442"
From MaRDI portal
The following pages link to On rainbow total-coloring of a graph (Q494442):
Displaying 10 items.
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← 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)
- Some results on the 3-total-rainbow index (Q2141205) (← links)
- Distance-local rainbow connection number (Q2158184) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)