On monochromatic paths in m-coloured tournaments
From MaRDI portal
(Redirected from Publication:1108286)
Recommendations
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- scientific article; zbMATH DE number 6470131
- Kernels by monochromatic directed paths in 3-colored tournaments and quasi-tournaments
- On the longest monochromatic paths in edge-colored tournaments
Cites work
Cited in
(45)- On panchromatic digraphs and the panchromatic number
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- An extension of Richardson's theorem in m-colored digraphs
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- scientific article; zbMATH DE number 5247098 (Why is no real title available?)
- Kernels by monochromatic paths and color-perfect digraphs
- Kernels and some operations in edge-coloured digraphs
- Characterization of color patterns by dynamic \(H\)-paths
- Monochromatic sinks in arc-colored tournaments with small feedback arc sets
- Kernels by monochromatic paths in digraphs with covering number 2
- Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs
- Alternating kernels
- \(k\)-colored kernels
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture
- \(\Gamma\)-cycles in arc-colored digraphs
- scientific article; zbMATH DE number 7057476 (Why is no real title available?)
- On kernels by rainbow paths in arc-coloured digraphs
- Kernels by rainbow paths in arc-colored tournaments
- Monotone reachability in arc-colored tournaments
- A counterexample to a conjecture on edge-coloured tournaments
- On the longest monochromatic paths in edge-colored tournaments
- scientific article; zbMATH DE number 6470131 (Why is no real title available?)
- Tournaments and Semicomplete Digraphs
- Domination in transitive colorings of tournaments
- A lower bound on the size of an absorbing set in an arc-coloured tournament
- On Ramsey-Turán type problems in tournaments
- Kernels in edge-coloured orientations of nearly complete graphs
- \(\Pi\)-kernels in digraphs
- Monochromatic loose paths in multicolored $k$-uniform cliques
- Kernels in edge-colored digraphs
- Monochromatic sinks in nearly transitive arc-colored tournaments
- \(H\)-kernels in infinite digraphs
- Absorbing sets in arc-coloured tournaments
- A new generalization of kernels in digraphs
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Independent and monochromatic absorbent sets in infinite digraphs
- Kernels by properly colored paths in arc-colored digraphs
- King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
- Monochromatic sinks in \(k\)-arc colored tournaments
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- Reachability problems in edge-colored digraphs
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- scientific article; zbMATH DE number 3885938 (Why is no real title available?)
This page was built for publication: On monochromatic paths in m-coloured tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108286)