Finite families of forbidden subgraphs for rainbow connection in graphs

DOI10.1016/J.DISC.2016.02.015zbMATH Open1338.05142OpenAlexW2418458435MaRDI QIDQ297932FDOQ297932

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

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

Recommendations

• Rainbow connection and forbidden subgraphs
• On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
• Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
• Rainbow vertex-connection and forbidden subgraphs
• Rainbow connection in 3-connected graphs

zbMATH Keywords

edge coloringrainbow connectionforbidden subgraphs

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• On rainbow connection
• Rainbow connections of graphs
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs
• Title not available (Why is that?)
• Hardness and algorithms for rainbow connection
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Rainbow connection in graphs with minimum degree three
• Graphs with rainbow connection number two
• Rainbow connection and forbidden subgraphs
• Rainbow connection number of dense graphs
• The rainbow connection number of 2-connected graphs
• On the theory of graphs
• Rainbow connection number and radius

Cited In (2)

• Total-rainbow connection and forbidden subgraphs
• 3-rainbow index and forbidden subgraphs

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

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