A note on perfect orders

DOI10.1016/0012-365X(89)90200-8zbMath0679.05066MaRDI QIDQ1124614

N. V. R. Mahadev, Chính T. Hoàng

Publication date: 1989

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

zbMATH Keywords

simplicial vertexDilworth numbercosimplicial vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

A note on perfectly orderable graphs, Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU, On simplicial and co-simplicial vertices in graphs., Recognizing quasi-triangulated graphs., On pairwise compatibility graphs having Dilworth number \(k\), Recognition of some perfectly orderable graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Topics on perfect graphs
• Locally perfect graphs
• Slim graphs
• A decomposition theorem for partially ordered sets
• Four classes of perfectly orderable graphs
• The Comparability Graph of a Tree