scientific article; zbMATH DE number 6719578

MaRDI QIDQ2987164zbMATH OpenFDO

Authors Xingchao Deng

Publication date 17 May 2017

zbMATH Keywords

FPT algorithmmodel of divide-and-conquerrainbow connection numbertree width

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• On the rainbow connectivity of graphs: complexity and FPT algorithms
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• A sharp upper bound for the strong rainbow connection number of a graph
• An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
• A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
• Upper bounds for the total rainbow connection of graphs
• Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
• Bounds for the rainbow connection number of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987164)