Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers

DOI10.1016/S0012-365X(98)00209-XzbMath0928.05030OpenAlexW2062222767MaRDI QIDQ1297441

Wenan Zang

Publication date: 9 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00209-x

zbMATH Keywords

vertex coverforbidden subgraphsacyclic digraphclique coversGallai-Milgram-Linial property

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Greene-Kleitman's theorem for general digraphs
• Some sequences associated with combinatorial structures
• Extending the Greene-Kleitman theorem to directed graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Covering digraphs by paths
• Normal hypergraphs and the perfect graph conjecture
• A decomposition theorem for partially ordered sets
• An algorithmic note on the gallai-milgram theorem
• The structure of Sperner k-families

This page was built for publication: Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers