Kernels by monochromatic paths in digraphs with covering number 2
From MaRDI portal
Publication:539857
DOI10.1016/J.DISC.2010.09.022zbMath1222.05083OpenAlexW2021340270MaRDI QIDQ539857
Mika Olsen, Hortensia Galeana-Sánchez
Publication date: 31 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.022
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernels in perfect graphs
- Kernels in edge-coloured orientations of nearly complete graphs
- On kernels by monochromatic paths in the corona of digraphs
- On monochromatic paths in m-coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- Kernels in a special class of digraphs
- Combinatorial game theory foundations applied to digraph kernels
- Combinatorial games: Selected bibliography with a succinct gourmet introduction
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- Absorbing sets in arc-coloured tournaments
- Kernels in digraphs with covering number at most 3
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Perfect graphs, kernels, and cores of cooperative games
- Recent problems and results about kernels in directed graphs
- On the orientation of meyniel graphs
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
This page was built for publication: Kernels by monochromatic paths in digraphs with covering number 2
