Reachability problems in edge-colored digraphs

DOI10.1016/j.disc.2006.09.042zbMath1127.05049OpenAlexW2005620597MaRDI QIDQ2643322

Peter Arpin, Vaclav Linek

Publication date: 23 August 2007

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

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

zbMATH Keywords

kerneltournamentmonochromatic pathreachability problemsedge colored digraph

Mathematics Subject Classification ID

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

Related Items (22)

Kernels by monochromatic paths and color-perfect digraphs ⋮ Richardson's theorem in \(H\)-coloured digraphs ⋮ On panchromatic patterns ⋮ \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \) ⋮ H-kernels by walks ⋮ Independent and monochromatic absorbent sets in infinite digraphs ⋮ H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. ⋮ \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph ⋮ \(H\)-kernels in infinite digraphs ⋮ H-kernels by walks in an \(R_H (D)\) digraph ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs ⋮ Restricted domination in quasi-transitive and 3-quasi-transitive digraphs ⋮ -panchromatic digraphs ⋮ Monochromatic sinks in nearly transitive arc-colored tournaments ⋮ Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels ⋮ $H$-kernels by walks in subdivision digraph ⋮ \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs ⋮ Characterization of color patterns by dynamic \(H\)-paths ⋮ Some conditions for the existence of Euler \(H\)-trails ⋮ \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs

Cites Work

• On Ramsey-Turán type problems in tournaments
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured 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
• Rooted spanning trees in tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reachability problems in edge-colored digraphs