Bithreshold Graphs
From MaRDI portal
Publication:3701461
DOI10.1137/0606049zbMATH Open0579.05052OpenAlexW4239569302MaRDI QIDQ3701461FDOQ3701461
Authors: Peter L. Hammer, N. V. R. Mahadev
Publication date: 1985
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0606049
Recommendations
Cites Work
Cited In (19)
- Strict 2-threshold graphs
- Bithreshold graphs
- Linear-time recognition of double-threshold graphs
- Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates
- Finding houses and holes in graphs
- Title not available (Why is that?)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- The relationship between the threshold dimension of split graphs and various dimensional parameters
- Degree sequences and majorization
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Probe threshold and probe trivially perfect graphs
- Some properties of 2-threshold graphs
- Thin strip graphs
- On dimensional properties of graphs
- Bigeodetic graphs
- On randomized stopping points and perfect graphs
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
- Bipartite bithreshold graphs
This page was built for publication: Bithreshold Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701461)