On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
type: Item
instance of: scholarly article
title: On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
zbMATH Open document ID: 1305.05150
author: Přemysl Holub
author: Zdeněk Ryjáček
author: Ingo Schiermeyer
published in: Discrete Mathematics
publication date: 2014-12-19T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6381946
zbMATH Keywords: rainbow connection
zbMATH Keywords: edge coloring
zbMATH Keywords: forbidden subgraph
MaRDI profile type: Publication
full work available at URL: j.disc.2014.10.006
OpenAlex ID: W2056262419
cites work: Dominating cliques in \(P_ 5\)-free graphs
cites work: Rainbow connection number and radius
cites work: Q5422499
cites work: On rainbow connection
cites work: Hardness and algorithms for rainbow connection
cites work: Rainbow connection number and connected dominating sets
cites work: Rainbow connection in graphs
cites work: The rainbow connection number of 2-connected graphs
cites work: Graphs with rainbow connection number two
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: Rainbow connection number of dense graphs
cites work: Rainbow connections of graphs: a survey
cites work: Rainbow Connection in Graphs with Minimum Degree Three
DOI: 10.1016/J.DISC.2014.10.006
description: scientific article; zbMATH DE number 6381946