Cycles and transitivity by monochromatic paths in arc-coloured digraphs
DOI10.1016/J.AKCEJ.2015.11.003zbMATH Open1346.05092OpenAlexW2244040271MaRDI QIDQ321986FDOQ321986
Authors: Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy 
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
Recommendations
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- \(\gamma \)-cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Kernels by monochromatic paths in digraphs with covering number 2
- Monochromatic paths and monochromatic cycles in edge-coloured \(k\)-partite tournaments.
- Kernels in edge-colored digraphs
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- On monochromatic paths in edge-coloured digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On kernel-perfect critical digraphs
- On monochromatic paths in m-coloured tournaments
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Graphes Noyau-Parfaits
- On kernels and semikernels of digraphs
- On kernels by monochromatic paths in the corona of digraphs
- A note on kernel-critical graphs
- Absorbing sets in arc-coloured tournaments
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- \(\gamma \)-cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
Cited In (16)
- Monochromatic directed walks in arc-colored directed graphs
- Kernels and some operations in edge-coloured digraphs
- Kernels in the closure of coloured digraphs
- On graphs all of whose \(\{C_3,T_3\}\)-free arc colorations are kernel-perfect
- \(\gamma \)-cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Kernels and cycles' subdivisions in arc-colored tournaments
- Kernels in monochromatic path digraphs
- Kernels by monochromatic paths in digraphs with covering number 2
- Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
- Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
- \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- Kernels by monochromatic paths and the color-class digraph
This page was built for publication: Cycles and transitivity by monochromatic paths in arc-coloured digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321986)
