Pages that link to "Item:Q5419848"
From MaRDI portal
The following pages link to The strong rainbow vertex-connection of graphs (Q5419848):
Displaying 24 items.
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- The rainbow vertex-index of complementary graphs (Q307925) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← links)
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Graphs with vertex rainbow connection number two (Q498122) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Injective coloring of some graph operations (Q1659655) (← links)
- Total rainbow connection of digraphs (Q1693154) (← links)
- On (strong) proper vertex-connection of graphs (Q1695612) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- Rainbow vertex \(k\)-connection in graphs (Q2444548) (← links)
- Proper rainbow connection number of graphs (Q2656335) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)