Pages that link to "Item:Q367069"

The following pages link to Rainbow connection in 3-connected graphs (Q367069):

Displaying 24 items.

• Hardness results for total rainbow connection of graphs (Q274688) (← links)
• Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
• Rainbow connection in some digraphs (Q503612) (← links)
• Coupon coloring of some special graphs (Q512874) (← links)
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
• The generalized 3-connectivity of star graphs and bubble-sort graphs (Q668787) (← links)
• Proper connection numbers of complementary graphs (Q723592) (← links)
• Proper connection number and connected dominating sets (Q896128) (← links)
• Injective coloring of some graph operations (Q1659655) (← links)
• Generalized rainbow connection of graphs and their complements (Q1708384) (← links)
• On 2-rainbow domination of generalized Petersen graphs (Q1730265) (← links)
• Coupon coloring of cographs (Q1738081) (← links)
• Rainbow connectivity of Moore cages of girth 6 (Q1801053) (← 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)
• Generalized rainbow connection of graphs (Q2239021) (← links)
• Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
• Graphs with small total rainbow connection number (Q2405975) (← links)
• Upper bounds of proper connection number of graphs (Q2410035) (← links)
• Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
• Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
• The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
• (Q2857372) (← links)