Pages that link to "Item:Q494442"
From MaRDI portal
The following pages link to On rainbow total-coloring of a graph (Q494442):
Displaying 21 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)
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- A rainbow about \(T\)-colorings for complete graphs (Q1918544) (← links)
- On rainbow-free colourings of uniform hypergraphs (Q1981770) (← 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)
- On colorings of the Boolean lattice avoiding a rainbow copy of a poset (Q2309558) (← 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)
- Vertex rainbow colorings of graphs (Q2906367) (← links)
- Rainbow Colouring of Split and Threshold Graphs (Q2914323) (← links)
- (Q3295503) (← links)
- Rainbow degree-jump coloring of graphs (Q5006774) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)
- A rainbow about T-colorings for complete graphs (Q6143976) (← links)
- Total-rainbow connection and forbidden subgraphs (Q6633552) (← links)
- Rainbow connection number of corona product of graphs (Q6669826) (← links)
