Bipartite bithreshold graphs

DOI10.1016/0012-365X(93)90118-DzbMath0790.05082MaRDI QIDQ688258

Peter L. Hammer, N. V. R. Mahadev, Uri N. Peled

Publication date: 26 June 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bithreshold graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items

Strict 2-threshold graphs ⋮ An \(O(n^ 3)\) recognition algorithm for bithreshold graphs

Cites Work

• The polytope of degree sequences
• Hamiltonian threshold graphs
• Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
• Multidimensional scaling and threshold graphs
• Strict 2-threshold graphs
• Ferrers digraphs and threshold graphs
• Extreme degree sequences of simple graphs
• Threshold Dimension of Graphs
• The Complexity of the Partial Order Dimension Problem
• Bithreshold Graphs
• Threshold characterization of graphs with dilworth number two
• Four classes of perfectly orderable graphs
• Incremental modular decomposition
• Some properties of 2-threshold graphs
• Sufficient Conditions for Graphs to Have Threshold Number 2
• Threshold Sequences
• Split Graphs Having Dilworth Number Two
• Threshold Numbers and Threshold Completions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item