Total rainbow connection of digraphs

DOI10.1016/j.dam.2017.10.016zbMath1377.05096arXiv1701.04283OpenAlexW2576610082MaRDI QIDQ1693154

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

digraphtournamenttotal rainbow connectionbiorientationcactus digraph

Mathematics Subject Classification ID

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

Related Items (14)

Some results on the 3-total-rainbow index ⋮ (Strong) proper vertex connection of some digraphs ⋮ On the complexity of \(k\)-rainbow cycle colouring problems ⋮ Relations of three classes of disconnected coloring ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ On total rainbow \(k\)-connected graphs ⋮ Proper connection and proper-walk connection of digraphs ⋮ 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 ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Total rainbow connection numbers of some special graphs ⋮ Note on directed proper connection number of a random graph ⋮ (Strong) total proper connection of some digraphs

Cites Work

• Unnamed Item
• Total rainbow \(k\)-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
• Rainbow connections of graphs: a survey
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Note on rainbow connection in oriented graphs with diameter 2
• The strong rainbow vertex-connection of graphs

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