Strict 2-threshold graphs

DOI10.1016/0166-218X(88)90048-0zbMATH Open0658.05063OpenAlexW2092353941MaRDI QIDQ1111574FDOQ1111574

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

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

Recommendations

• Recognizing strict 2-threshold graphs in O(m) time
• Bithreshold graphs
• Some properties of 2-threshold graphs
• Threshold graphs
• scientific article; zbMATH DE number 1263242

zbMATH Keywords

algorithmedge set2-threshold graphtriangles in graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• On the notion of balance of a signed graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of the Partial Order Dimension Problem
• Four classes of perfectly orderable graphs
• Title not available (Why is that?)
• Bithreshold Graphs
• Some properties of 2-threshold graphs
• Sufficient Conditions for Graphs to Have Threshold Number 2
• Bipartite bithreshold graphs

Cited In (10)

• Bithreshold graphs
• The lexicographic method for the threshold cover problem
• Title not available (Why is that?)
• Split graphs
• Title not available (Why is that?)
• Probe threshold and probe trivially perfect graphs
• Some properties of 2-threshold graphs
• Recognizing strict 2-threshold graphs in O(m) time
• Bipartite bithreshold graphs
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: Strict 2-threshold graphs

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