The following pages link to The Dilworth Number of a Graph (Q4170758):
Displaying 17 items.
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions (Q414467) (← links)
- A bound for the Dilworth number (Q809096) (← links)
- Vicinal orders of trees (Q810522) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Simple games and magic squares (Q1894010) (← links)
- Distance eigenvalues of a cograph and their multiplicities (Q2226412) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- The solid-metric dimension (Q2285129) (← links)
- Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
- On pairwise compatibility graphs having Dilworth number two (Q2637346) (← links)
- Positional Dominance: Concepts and Algorithms (Q2971635) (← links)
- Threshold Sequences (Q3964623) (← links)
- Re-conceptualizing centrality in social networks (Q4594627) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Complete signed graphs with largest maximum or smallest minimum eigenvalue (Q6117351) (← links)
- Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs (Q6592900) (← links)
