Reachability problems in edge-colored digraphs

DOI10.1016/J.DISC.2006.09.042zbMATH Open1127.05049OpenAlexW2005620597MaRDI QIDQ2643322FDOQ2643322

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

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

Cites Work

• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths in m-coloured tournaments
• A counterexample to a conjecture on edge-coloured tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Monotone reachability in arc-colored tournaments
• Absorbing sets in arc-coloured tournaments
• On Ramsey-Turán type problems in tournaments
• Rooted spanning trees in tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Richardson's theorem in \(H\)-coloured digraphs
• Monochromatic sinks in nearly transitive arc-colored tournaments
• Some conditions for the existence of Euler \(H\)-trails
• \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
• Kernels by monochromatic paths and color-perfect digraphs
• -panchromatic digraphs
• Characterization of color patterns by dynamic \(H\)-paths
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
• \((H, k)\)-reachability in \(H\)-arc-colored digraphs
• $H$-kernels by walks in subdivision digraph
• A generalization of properly colored paths and cycles in edge-colored graphs
• \(H\)-kernels in infinite 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
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Independent and monochromatic absorbent sets in infinite digraphs
• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
• H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
• H-kernels by walks in an \(R_H (D)\) digraph
• Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels

Recommendations

• Title not available (Why is that?) 👍 👎
• A generalization of edge-coloring in graphs 👍 👎
• NP-completeness of edge-colouring some restricted graphs 👍 👎
• Edge-Coloring Problems for Graphs. 👍 👎
• Planar and grid graph reachability problems 👍 👎
• Reachability relations in digraphs 👍 👎
• Reachability problems in interval-constrained and cardinality-constrained graphs 👍 👎
• On resolving edge colorings in graphs 👍 👎
• Reachability Problems on Directed Graphs 👍 👎
• On connectivities of edge-colored graphs 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643322)