On monochromatic paths in m-coloured tournaments
From MaRDI portal
DOI10.1016/0095-8956(88)90059-7zbMATH Open0654.05033OpenAlexW2045621845MaRDI QIDQ1108286FDOQ1108286
Authors: Shen Minggang 
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(88)90059-7
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
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
Cited In (46)
- Kernels and some operations in edge-coloured digraphs
- Domination in transitive colorings of tournaments
- \(k\)-colored kernels
- Monochromatic sinks in nearly transitive arc-colored tournaments
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- Kernels by monochromatic paths and color-perfect digraphs
- Characterization of color patterns by dynamic \(H\)-paths
- Monochromatic paths in random tournaments
- Kernels by monochromatic paths in digraphs with covering number 2
- 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
- Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs
- Monochromatic loose paths in multicolored $k$-uniform cliques
- \(H\)-kernels in infinite digraphs
- An extension of Richardson's theorem in m-colored digraphs
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture
- Kernels in edge-colored digraphs
- On the longest monochromatic paths in edge-colored tournaments
- Kernels by properly colored paths in arc-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Independent and monochromatic absorbent sets in infinite digraphs
- Title not available (Why is that?)
- Monochromatic sinks in arc-colored tournaments with small feedback arc sets
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- On panchromatic digraphs and the panchromatic number
- Kernels by rainbow paths in arc-colored tournaments
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- On kernels by rainbow paths in arc-coloured digraphs
- Tournaments and Semicomplete Digraphs
- Monochromatic sinks in \(k\)-arc colored tournaments
- Reachability problems in edge-colored digraphs
- \(\Gamma\)-cycles in arc-colored digraphs
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- Alternating kernels
- Absorbing sets in arc-coloured tournaments
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- Monotone reachability in arc-colored tournaments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new generalization of kernels in digraphs
- King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
- \(\Pi\)-kernels in digraphs
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)
