Rainbow antistrong connection in tournaments

DOI10.1007/S00373-020-02234-0MaRDI QIDQ2657075zbMATH OpenOpenAlexFDO

Authors Yumei Hu, Yarong Wei

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-020-02234-0

zbMATH Keywords

antistrong digraphsrainbow connectedstrong rainbow connectedtournaments

Mathematics Subject Classification ID

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

Recommendations

• Strong rainbow connection in digraphs
• Rainbow connection in oriented graphs
• Rainbow connections in digraphs
• Rainbow vertex connection of digraphs
• Rainbow connectivity of cacti and of some infinite digraphs

Cites work

• Antistrong digraphs
• Digraphs
• Graph theory
• Hardness and algorithms for rainbow connection
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• Rainbow connection in graphs
• Rainbow connection in oriented graphs
• Rainbow connection in some digraphs
• Rainbow connectivity of cacti and of some infinite digraphs
• Rainbow vertex connection of digraphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

Cited in

(5)

• Strong rainbow connection in digraphs
• Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
• Note on rainbow connection in oriented graphs with diameter 2
• Ore conditions for antistrong digraphs
• Classical conditions for (weakly-)antistrong digraphs

This page was built for publication: Rainbow antistrong connection in tournaments

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