The Dilworth Number of a Graph
From MaRDI portal
Publication:4170758
DOI10.1016/S0167-5060(08)70334-0zbMath0389.05048OpenAlexW119366631MaRDI QIDQ4170758
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
Related Items
Threshold Sequences, On randomized stopping points and perfect graphs, Simple games and magic squares, On pairwise compatibility graphs having Dilworth number two, Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU, Re-conceptualizing centrality in social networks, Complete signed graphs with largest maximum or smallest minimum eigenvalue, Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions, Positional Dominance: Concepts and Algorithms, Distance eigenvalues of a cograph and their multiplicities, On pairwise compatibility graphs having Dilworth number \(k\), Recognition of split-graphic sequences, The solid-metric dimension, Cographs: eigenvalues and Dilworth number, A bound for the Dilworth number, Vicinal orders of trees