Sufficient Conditions for Graphs to Have Threshold Number 2
From MaRDI portal
Publication:3936783
DOI10.1016/S0304-0208(08)73469-8zbMath0479.05058OpenAlexW149789455MaRDI QIDQ3936783
Uri N. Peled, Toshihide Ibaraki
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
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
Some complexity results about threshold graphs, Split graphs, Strict 2-threshold graphs, Threshold Dimension of Graphs, Recognizing simple-triangle graphs by restricted 2-chain subgraph cover, Split dimension of graphs, Dominating cliques in graphs, An \(O(n^ 3)\) recognition algorithm for bithreshold graphs, Bipartite bithreshold graphs, The lexicographic method for the threshold cover problem, Dominating cliques in graphs, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, The Complexity of the Partial Order Dimension Problem, The relationship between the threshold dimension of split graphs and various dimensional parameters
