Some properties of 2-threshold graphs

DOI10.1002/NET.3230190103MaRDI QIDQ3824454zbMATH OpenOpenAlexFDO

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

Publication date 1989

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230190103

zbMATH Keywords

threshold graphschordless cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• Strict 2-threshold graphs
• Recognizing strict 2-threshold graphs in O(m) time
• Bipartite bithreshold graphs
• The lexicographic method for the threshold cover problem
• Bithreshold Graphs

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• Private Observation, Communication and Collusion

Cited in

(8)

• Strict 2-threshold graphs
• The lexicographic method for the threshold cover problem
• Threshold characterization of graphs with dilworth number two
• H-product of graphs, H-threshold graphs and threshold-width of graphs
• Some Properties of Chain and Threshold Graphs
• Recognizing strict 2-threshold graphs in O(m) time
• An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
• Bipartite bithreshold graphs

This page was built for publication: Some properties of 2-threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3824454)