Total rainbow connection of digraphs

DOI10.1016/J.DAM.2017.10.016MaRDI QIDQ1693154zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 11 January 2018

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

Full work available at URL https://arxiv.org/abs/1701.04283

zbMATH Keywords

biorientationcactus digraphdigraphtotal rainbow connectiontournament

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Abstract: An edge-coloured path is rainbow if its edges have distinct colours. For a connected graph $G$, the rainbow connection number (resp. strong rainbow connection number) of $G$ is the minimum number of colours required to colour the edges of $G$ so that, any two vertices of $G$ are connected by a rainbow path (resp. rainbow geodesic). These two graph parameters were introduced by Chartrand, Johns, McKeon and Zhang in 2008. Krivelevich and Yuster generalised this concept to the vertex-coloured setting. Similarly, Liu, Mestre and Sousa introduced the version which involves total-colourings. Dorbec, Schiermeyer, Sidorowicz and Sopena extended the concept of the rainbow connection to digraphs. In this paper, we consider the (strong) total rainbow connection number of digraphs. Results on the (strong) total rainbow connection number of biorientations of graphs, tournaments and cactus digraphs are presented.

Recommendations

• Rainbow vertex connection of digraphs
• Rainbow connections in digraphs
• On various (strong) rainbow connection numbers of graphs
• Rainbow connection in some digraphs
• Strong rainbow connection in digraphs

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Note on rainbow connection in oriented graphs with diameter 2
• Rainbow connection in graphs
• Rainbow connection in oriented graphs
• Rainbow connection in some digraphs
• Rainbow connectivity of cacti and of some infinite digraphs
• Strong rainbow connection in digraphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The strong rainbow vertex-connection of graphs
• Total rainbow \(k\)-connection in graphs

Cited in

(20)

• Rainbow vertex connection of digraphs
• Strong rainbow connection in digraphs
• Rainbow connection numbers of Cayley digraphs on abelian groups
• On total rainbow \(k\)-connected graphs
• Rainbow connections in digraphs
• The generalized 3-connectivity of the Mycielskian of a graph
• Minimum degree and size conditions for the proper connection number of graphs
• (Strong) total proper connection of some digraphs
• Some results on the 3-total-rainbow index
• Distance-local rainbow connection number
• Proper connection and proper-walk connection of digraphs
• Total rainbow connection numbers of some special graphs
• Note on directed proper connection number of a random graph
• On the complexity of \(k\)-rainbow cycle colouring problems
• Rainbow connection in oriented graphs
• Rainbow connection in some digraphs
• On various (strong) rainbow connection numbers of graphs
• (Strong) proper vertex connection of some digraphs
• Relations of three classes of disconnected coloring
• Some results on (strong) total proper connection number of some digraphs

This page was built for publication: Total rainbow connection of digraphs

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