On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments

DOI10.1016/j.disc.2004.03.005zbMath1049.05042OpenAlexW2015474113MaRDI QIDQ1877676

Hortensia Galeana-Sánchez, Rocío Rojas-Monroy

Publication date: 19 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.03.005

zbMATH Keywords

digraphkernel by monochromatic paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Independent and monochromatic absorbent sets in infinite digraphs ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ Alternating kernels ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ \(k\)-colored kernels ⋮ Kernels by properly colored paths in arc-colored 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

Cites Work

• Unnamed Item
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Kernels in the closure of coloured digraphs
• Graphes Noyau-Parfaits

This page was built for publication: On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments