Sufficient Conditions for Graphs to Have Threshold Number 2

DOI10.1016/S0304-0208(08)73469-8MaRDI QIDQ3936783zbMATH OpenOpenAlexFDO

Authors Toshihide Ibaraki, Uri N. Peled

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73469-8

zbMATH Keywords

chromatic numberthreshold graphthreshold number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(14)

• Strict 2-threshold graphs
• Split dimension of graphs
• Some complexity results about threshold graphs
• Split graphs
• Threshold Dimension of Graphs
• The Complexity of the Partial Order Dimension Problem
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
• Dominating cliques in graphs
• Dominating cliques in graphs
• The lexicographic method for the threshold cover problem
• Threshold graphs and synchronization protocols
• An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
• Bipartite bithreshold graphs
• The relationship between the threshold dimension of split graphs and various dimensional parameters

This page was built for publication: Sufficient Conditions for Graphs to Have Threshold Number 2

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