Pages that link to "Item:Q491198"
From MaRDI portal
The following pages link to Hardness and algorithms for rainbow connection (Q491198):
Displaying 50 items.
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- On finding rainbow and colorful paths (Q266284) (← links)
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- Note on the upper bound of the rainbow index of a graph (Q298957) (← links)
- Rainbow connection number of amalgamation of some graphs (Q322063) (← links)
- Some remarks on rainbow connectivity (Q322204) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- Rainbow connection number and independence number of a graph (Q343733) (← links)
- Rainbow colouring of split graphs (Q344835) (← links)
- Rainbow connection in 3-connected graphs (Q367069) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- The rainbow connection number of 2-connected graphs (Q383747) (← links)
- Further hardness results on the rainbow vertex-connection number of graphs (Q385046) (← links)
- Rainbow connection of graphs with diameter 2 (Q408184) (← links)
- Rainbow connection in oriented graphs (Q477332) (← links)
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 (Q482191) (← links)
- Rainbow connection number of graph power and graph products (Q489302) (← links)
- Rainbow connection number and the number of blocks (Q489352) (← links)
- Rainbow connection in some digraphs (Q503612) (← links)
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← 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)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420) (← links)
- Rainbow connection numbers of Cayley digraphs on abelian groups (Q1739982) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- Rainbow connection and graph products (Q2014711) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Rainbow \(k\)-connectivity of random bipartite graphs (Q2025233) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Rainbow connectivity and rainbow criticality on graph classes (Q2091815) (← links)
- Upper bounding rainbow connection number by forest number (Q2138952) (← links)
- More on the rainbow disconnection in graphs (Q2158198) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph (Q2303722) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- Rainbow connection numbers of Cayley graphs (Q2410037) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- The rainbow connection number of the power graph of a finite group (Q2631090) (← links)
