Upper bounds for the rainbow connection numbers of line graphs
From MaRDI portal
Publication:1926059
DOI10.1007/s00373-011-1034-1zbMath1256.05073arXiv1001.0287MaRDI QIDQ1926059
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0287
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C40: Connectivity
05C76: Graph operations (line graphs, products, etc.)
Related Items
Strong rainbow connection numbers of toroidal meshes, Tight upper bound of the rainbow vertex-connection number for 2-connected graphs, Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number, On total rainbow \(k\)-connected graphs, Rainbow connections of graphs: a survey, The rainbow connection number of the power graph of a finite group
Cites Work