Finite families of forbidden subgraphs for rainbow connection in graphs

DOI10.1016/j.disc.2016.02.015zbMath1338.05142OpenAlexW2418458435MaRDI QIDQ297932

Petr Vrána, Přemysl Holub, Zdeněk Ryjáček, Jan Brousek

Publication date: 20 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.015

zbMATH Keywords

edge coloringforbidden subgraphsrainbow connection

Mathematics Subject Classification ID

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

Related Items (1)

3-rainbow index and forbidden subgraphs

Cites Work

• The rainbow connection number of 2-connected graphs
• Hardness and algorithms for rainbow connection
• Rainbow connection number and radius
• On rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow connection and forbidden subgraphs
• Rainbow connection number of dense graphs
• Rainbow connection number and connected dominating sets
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• On the theory of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite families of forbidden subgraphs for rainbow connection in graphs