The Dilworth Number of a Graph

DOI10.1016/S0167-5060(08)70334-0zbMATH Open0389.05048OpenAlexW119366631MaRDI QIDQ4170758FDOQ4170758

Authors: Peter L. Hammer, Stephane Foldes 

Publication date: 1978

Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70334-0

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited In (17)

• On pairwise compatibility graphs having Dilworth number \(k\)
• The solid-metric dimension
• Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
• Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs
• On pairwise compatibility graphs having Dilworth number two
• Positional dominance: concepts and algorithms
• Recognition of split-graphic sequences
• Cographs: eigenvalues and Dilworth number
• Re-conceptualizing centrality in social networks
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
• Distance eigenvalues of a cograph and their multiplicities
• Threshold Sequences
• Complete signed graphs with largest maximum or smallest minimum eigenvalue
• Simple games and magic squares
• A bound for the Dilworth number
• Vicinal orders of trees
• On randomized stopping points and perfect graphs

This page was built for publication: The Dilworth Number of a Graph

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