On the maximal order of cyclicity of antisymmetric directed graphs

DOI10.1016/0012-365X(75)90092-8MaRDI QIDQ1214941zbMATH OpenFDO

Authors Anton Kotzig

Publication date 1975

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(75)90092-8

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cites work

• Graphs with forbidden subgraphs
• Parallel concepts in graph theory

Cited in

(3)

• The reversing number of a digraph
• A survey on the linear ordering problem for weighted or unweighted tournaments
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: On the maximal order of cyclicity of antisymmetric directed graphs

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