Nombre Maximum D'arcs D'un Graphe Antisymetrique Sans Chemin De Longueur 1

DOI10.1016/S0304-0208(08)73406-6zbMATH Open0522.05029OpenAlexW185836260MaRDI QIDQ3672011FDOQ3672011

Marie-Claude Heydemann

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73406-6

zbMATH Keywords

strongly connected digraphantisymmetric digraphexistence of path length in oriented graphminimum of arcs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

This page was built for publication: Nombre Maximum D'arcs D'un Graphe Antisymetrique Sans Chemin De Longueur 1

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