Monochromatic paths and circuits in edge-colored graphs

DOI10.1016/0095-8956(71)90054-2zbMath0204.57302OpenAlexW2037591235MaRDI QIDQ2542059

D. T. Busolini

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(71)90054-2

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Monochromatic directed walks in arc-colored directed graphs ⋮ Monochromatic paths in edge-colored graphs

Cites Work

• A Simple Proof of a Theorem of Erdös and Szekeres^*

This page was built for publication: Monochromatic paths and circuits in edge-colored graphs