A counterexample to a conjecture on edge-coloured tournaments
From MaRDI portal
Publication:1827758
DOI10.1016/j.disc.2003.11.015zbMath1042.05039OpenAlexW2029302478WikidataQ123202202 ScholiaQ123202202MaRDI QIDQ1827758
Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.015
Related Items
Kernels by monochromatic paths and color-perfect digraphs, A lower bound on the size of an absorbing set in an arc-coloured tournament, Monochromatic sinks in \(k\)-arc colored tournaments, Cycles and transitivity by monochromatic paths in arc-coloured digraphs, Reachability problems in edge-colored digraphs, \(H\)-kernels in infinite digraphs, Kernels by rainbow paths in arc-colored tournaments, \(\Gamma\)-cycles in arc-colored digraphs, \(k\)-colored kernels, On panchromatic digraphs and the panchromatic number, Restricted domination in quasi-transitive and 3-quasi-transitive digraphs, Kernels in edge-coloured orientations of nearly complete graphs, Kernels by properly colored paths in arc-colored digraphs, A new generalization of kernels in digraphs, King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments, Kernels by monochromatic paths in digraphs with covering number 2, On kernels by rainbow paths in arc-coloured digraphs, Unnamed Item, Tournaments and Semicomplete Digraphs, \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
Cites Work
