Pages that link to "Item:Q638512"
From MaRDI portal
The following pages link to The complexity of determining the rainbow vertex-connection of a graph (Q638512):
Displaying 39 items.
- On finding rainbow and colorful paths (Q266284) (← links)
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Further hardness results on the rainbow vertex-connection number of graphs (Q385046) (← 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)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← 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)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- Injective coloring of some graph operations (Q1659655) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- On (strong) proper vertex-connection of graphs (Q1695612) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← 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)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- Proper rainbow connection number of graphs (Q2656335) (← links)
- The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← 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)
- Rainbow vertex-connection and graph products (Q5739599) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
- Relations of three classes of disconnected coloring (Q6153478) (← links)
- Temporally connected components (Q6612544) (← links)
