A bound for the Dilworth number

DOI10.1016/0012-365X(90)90153-9zbMATH Open0732.05036OpenAlexW2046245502MaRDI QIDQ809096FDOQ809096

M. Van Wouwe, Cyriel Van Nuffelen

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)

Cites Work

• `` Strong NP-Completeness Results
• A decomposition theorem for partially ordered sets
• The structure of Sperner k-families
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• Title not available (Why is that?)
• The Dilworth Number of a Graph
• On partitions of a partially ordered set
• On Dilworth's theorem in the infinite case
• Title not available (Why is that?)
• On Dilworth's decomposition theorem for partially ordered sets
• A Note on Dilworth's Embedding Theorem
• Title not available (Why is that?)

Cited In (1)

• Split graphs of Dilworth number 2

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on perfect orders 👍 👎
• Split graphs of Dilworth number 2 👍 👎
• Threshold characterization of graphs with dilworth number two 👍 👎

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)