Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2

DOI10.1016/j.disc.2015.10.020zbMath1327.05182OpenAlexW2195278227MaRDI QIDQ898171

Zdeněk Ryjáček, Ingo Schiermeyer, Přemysl Holub, Petr Vrána

Publication date: 8 December 2015

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

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

zbMATH Keywords

edge coloringforbidden subgraphsrainbow connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Loose edge-connection of graphs ⋮ Odd connection and odd vertex-connection of graphs ⋮ From colourful to rainbow paths in graphs: colouring the vertices

Cites Work

• Unnamed Item
• The rainbow connection number of 2-connected graphs
• Rainbow connection of graphs with diameter 2
• On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
• Rainbow connection number and radius
• On rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow connection and forbidden subgraphs
• Rainbow connection number, bridges and radius
• 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

This page was built for publication: Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2