Sur le circuit hamiltonien bi-colore dans les graphes orientes

DOI10.1007/BF02018596zbMATH Open0267.05114OpenAlexW2071681141MaRDI QIDQ2562873FDOQ2562873

Authors: 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

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

Cited In (7)

• Nombres de Ramsey dans le cas oriente
• The size Ramsey number of a directed path
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs
• Monochromatic trees in random tournaments
• Zeons, orthozeons, and graph colorings
• 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

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