A bound for the Dilworth number

DOI10.1016/0012-365X(90)90153-9MaRDI QIDQ809096zbMATHOpenAlexFDO

Authors Cyriel Van Nuffelen, M. Van Wouwe

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90153-9

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Publication:4205460
• scientific article; zbMATH DE number 4210179
• A note on perfect orders
• Split graphs of Dilworth number 2
• Threshold characterization of graphs with dilworth number two

Cites work

• scientific article; zbMATH DE number 3472052 (Why is no real title available?)
• scientific article; zbMATH DE number 3636072 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• A Note on Dilworth's Embedding Theorem
• A decomposition theorem for partially ordered sets
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• On Dilworth's decomposition theorem for partially ordered sets
• On Dilworth's theorem in the infinite case
• On partitions of a partially ordered set
• The Dilworth Number of a Graph
• The structure of Sperner k-families
• `` Strong NP-Completeness Results

Cited in

(2)

• scientific article; zbMATH DE number 4125434 (Why is no real title available?)
• Split graphs of Dilworth number 2

This page was built for publication: A bound for the Dilworth number

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