Cycles and transitivity by monochromatic paths in arc-coloured digraphs
From MaRDI portal
Publication:321986
DOI10.1016/j.akcej.2015.11.003zbMath1346.05092OpenAlexW2244040271MaRDI QIDQ321986
Enrique Casas-Bautista, Rocío Rojas-Monroy, Hortensia Galeana-Sánchez
Publication date: 14 October 2016
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.003
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
\(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \) ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernels and semikernels of digraphs
- On kernels by monochromatic paths in the corona of digraphs
- On kernel-perfect critical digraphs
- On monochromatic paths in m-coloured tournaments
- A note on kernel-critical graphs
- On monochromatic paths in edge-coloured digraphs
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- Absorbing sets in arc-coloured tournaments
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- γ-cycles and transivity by monochromatic paths in arc-coloured digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Graphes Noyau-Parfaits
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
This page was built for publication: Cycles and transitivity by monochromatic paths in arc-coloured digraphs
