Cycles and transitivity by monochromatic paths in arc-coloured digraphs
From MaRDI portal
(Redirected from Publication:321986)
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
Cites work
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 5551581 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A counterexample to a conjecture on edge-coloured tournaments
- A note on kernel-critical graphs
- Absorbing sets in arc-coloured tournaments
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
- Graphes Noyau-Parfaits
- Kernels in edge-colored digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- On kernel-perfect critical digraphs
- On kernels and semikernels of digraphs
- On kernels by monochromatic paths in the corona of digraphs
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- On monochromatic paths in m-coloured tournaments
- \(\gamma \)-cycles and transitivity by monochromatic paths in arc-coloured digraphs
Cited in
(18)- 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
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Kernels and cycles' subdivisions in arc-colored tournaments
- Kernels by monochromatic paths in digraphs with covering number 2
- Kernels in monochromatic path digraphs
- 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
- \(\Gamma\)-cycles in arc-colored digraphs
- 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)