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

DOI10.1016/S0012-365X(98)00209-XzbMATH Open0928.05030OpenAlexW2062222767MaRDI QIDQ1297441FDOQ1297441

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

Recommendations

• scientific article; zbMATH DE number 1539543
• scientific article; zbMATH DE number 4045794
• Acyclic graphoidal covers and path partitions in a graph
• Simple acyclic graphoidal covers in a graph
• Clique coverings and partitions of line graphs
• Clique covering and clique partition in generalizations of line graphs
• On a property of cyclic covers ofp-graphs
• scientific article; zbMATH DE number 147647
• Covering pairs in directed acyclic graphs
• scientific article; zbMATH DE number 68565

zbMATH Keywords

vertex coveracyclic digraphforbidden subgraphsclique coversGallai-Milgram-Linial property

Mathematics Subject Classification ID

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

Cites Work

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

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

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