Sur le circuit hamiltonien bi-colore dans les graphes orientes

DOI10.1007/BF02018596zbMath0267.05114OpenAlexW2071681141MaRDI QIDQ2562873

Yanyan Li

Publication date: 1973

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

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

Mathematics Subject Classification ID

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

Related Items (9)

Zeons, orthozeons, and graph colorings ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic paths in random tournaments ⋮ The size Ramsey number of a directed path ⋮ Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs ⋮ Directed Ramsey number for trees ⋮ Nombres de Ramsey dans le cas oriente ⋮ Monochromatic trees in random tournaments ⋮ A Ramsey-type problem in directed and bipartite graphs

This page was built for publication: Sur le circuit hamiltonien bi-colore dans les graphes orientes