Pages that link to "Item:Q378215"

The following pages link to On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215):

Displaying 19 items.

• On finding rainbow and colorful paths (Q266284) (← links)
• Hardness results for total rainbow connection of graphs (Q274688) (← links)
• Total rainbow connection number and complementary graph (Q310863) (← links)
• Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← 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)
• On total rainbow \(k\)-connected graphs (Q1739988) (← links)
• (Strong) total proper connection of some digraphs (Q2045035) (← links)
• Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
• Some results on the total proper \(k\)-connection number (Q2135063) (← links)
• Total rainbow connection numbers of some special graphs (Q2279465) (← links)
• Graphs with small total rainbow connection number (Q2405975) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
• Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
• Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276) (← links)
• An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)