The Dilworth Number of a Graph

DOI10.1016/S0167-5060(08)70334-0MaRDI QIDQ4170758zbMATH OpenOpenAlexFDO

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

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

Cited in

(18)

• On randomized stopping points and perfect graphs
• Simple games and magic squares
• 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
• On pairwise compatibility graphs having Dilworth number two
• Positional dominance: concepts and algorithms
• Threshold Sequences
• Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
• Re-conceptualizing centrality in social networks
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
• Complete signed graphs with largest maximum or smallest minimum eigenvalue
• Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs
• On relations between neighborhoods of threshold and Ferrers digraphs
• A bound for the Dilworth number
• Vicinal orders of trees

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)