Monochromatic directed walks in arc-colored directed graphs

DOI10.1007/BF01956320zbMath0613.05032OpenAlexW1994009802MaRDI QIDQ1088681

Noga Alon

Publication date: 1987

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01956320

zbMATH Keywords

directed graphdirected pathmonochromatic directed walkmonochromatic walk

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Maximum directed cuts in acyclic digraphs ⋮ Ramsey-nice families of graphs

Cites Work

• Unnamed Item
• Monochromatic paths and circuits in edge-colored graphs
• Monochromatic paths in edge-colored graphs
• A decomposition theorem for partially ordered sets
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: Monochromatic directed walks in arc-colored directed graphs