Strict 2-threshold graphs

DOI10.1016/0166-218X(88)90048-0zbMath0658.05063OpenAlexW2092353941MaRDI QIDQ1111574

Uri N. Peled, N. V. R. Mahadev

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90048-0

zbMATH Keywords

algorithmedge set2-threshold graphtriangles in graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Split graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Recognizing strict 2-threshold graphs in O(m) time ⋮ Bipartite bithreshold graphs ⋮ Probe threshold and probe trivially perfect graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipartite bithreshold graphs
• On the notion of balance of a signed graph
• The Complexity of the Partial Order Dimension Problem
• Bithreshold Graphs
• Four classes of perfectly orderable graphs
• Some properties of 2-threshold graphs
• Sufficient Conditions for Graphs to Have Threshold Number 2