Monotone reachability in arc-colored tournaments

zbMATH Open0976.05029MaRDI QIDQ2716675FDOQ2716675

K. B. Reid

Publication date: 2 January 2002

Published in: Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

coloringpathtournamentreflexive digraph

Mathematics Subject Classification ID

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

Cited In (8)

• Richardson's theorem in \(H\)-coloured digraphs
• Monochromatic sinks in nearly transitive arc-colored tournaments
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• \(H\)-kernels in infinite digraphs
• On panchromatic patterns
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Title not available (Why is that?)
• Reachability problems in edge-colored digraphs

This page was built for publication: Monotone reachability in arc-colored tournaments

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