Kernels in edge-coloured orientations of nearly complete graphs

DOI10.1016/J.DISC.2007.08.079zbMath1152.05028OpenAlexW2086453403MaRDI QIDQ941406

Hortensia Galeana-Sánchez

Publication date: 4 September 2008

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

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

zbMATH Keywords

kernelorientationkernel by monochromatic paths

Mathematics Subject Classification ID

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

Related Items (1)

Kernels by monochromatic paths in digraphs with covering number 2

Cites Work

• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• Absorbing sets in arc-coloured tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Kernels in the closure of coloured digraphs
• On graphs all of whose {C_3, T_3}-free arc colorations are kernel-perfect
• Unnamed Item

This page was built for publication: Kernels in edge-coloured orientations of nearly complete graphs