Pages that link to "Item:Q491198"

The following pages link to Hardness and algorithms for rainbow connection (Q491198):

Displaying 20 items.

• Rainbow antistrong connection in tournaments (Q2657075) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
• Rainbow Connection of Random Regular Graphs (Q3452164) (← links)
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths (Q4957978) (← links)
• Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
• Rainbow perfect domination in lattice graphs (Q5009971) (← links)
• Rainbow connection number of comb product of graphs (Q5054042) (← links)
• The strong 3-rainbow index of edge-comb product of a path and a connected graph (Q5081205) (← links)
• The strong 3-rainbow index of some certain graphs and its amalgamation (Q5089897) (← links)
• Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276) (← links)
• On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
• On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
• An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
• (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
• A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
• Loose edge-connection of graphs (Q6166663) (← links)
• On 3-degree 4-chordal graphs (Q6174132) (← links)
• Counting on rainbow \(k\)-connections (Q6636091) (← links)
• Rainbow connection number of corona product of graphs (Q6669826) (← links)