𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Threshold tolerance graphs

✍ Scribed by Clyde L. Monma; Bruce Reed; William T. Trotter Jr.


Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
994 KB
Volume
12
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, we introduce a class of graphs that generalize threshold graphs by introducing threshold tolerances. Several characterizations of these graphs are presented, one of which leads to a polynomial-time recognition algorithm. It is also shown that the complements of these graphs contain interval graphs and threshold graphs, and are contained in the subclass of chordal graphs called strongly chordal graphs, and in the class of interval tolerance graphs.


πŸ“œ SIMILAR VOLUMES


Tolerance graphs
✍ Martin Charles Golumbic; Clyde L. Monma; William T. Trotter Jr. πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 756 KB
Tolerance competition graphs
✍ R.C. Brigham; F.R. McMorris; R.P. Vitray πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 877 KB
Box-threshold graphs
✍ Uri N. Peled; Bruno Simeone πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 608 KB

A graph is called box-threshold when all pairs of vertices with incomparable neighborhoods have the same degree. Several properties of box-threshold graphs, generalizing properties of threshold graphs, are proved. A transportation model with priority constraints is used to characterize their degree

Quasi-threshold graphs
✍ Yan Jing-Ho; Chen Jer-Jeong; Gerard J. Chang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 589 KB
Hamiltonian threshold graphs
✍ Frank Harary; Uri Peled πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 258 KB