Upper bounding rainbow connection number by forest number

DOI10.1016/j.disc.2022.112829zbMath1490.05067arXiv2006.06551OpenAlexW4214717099MaRDI QIDQ2138952

L. Sunil Chandran, Juho Lauri, Erik Jan van Leeuwen, Davis Issac

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.06551

zbMATH Keywords

upper boundrainbow connectionforest number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Uses Software

• GraPHedron

Cites Work

• Some remarks on rainbow connectivity
• The rainbow connection number of 2-connected graphs
• Rainbow connection in oriented graphs
• Hardness and algorithms for rainbow connection
• Rainbow connection number and radius
• Facet defining inequalities among graph invariants: The system graphedron
• On rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Upper bounding rainbow connection number by forest number