1 citations · 1 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
The rainbow connection number of 2-connected graphs
Jan Ekstein, Přemysl Holub, Tomáš Kaiser +4
The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which…
math.CO2011★ 1 cited
Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs
Binlong Li, Zdeněk Ryjáček, Ying Wang +1
Let be a graph on vertices. An induced subgraph of is called heavy if there exist two nonadjacent vertices in with degree sum at least in . We say that $…