✦ LIBER ✦

Quasi-threshold graphs

✍ Scribed by Yan Jing-Ho; Chen Jer-Jeong; Gerard J. Chang

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 589 KB
Volume: 69
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(96)00094-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Threshold tolerance graphs

✍ Clyde L. Monma; Bruce Reed; William T. Trotter Jr. 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 994 KB

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 in

Hamiltonian threshold graphs

✍ Frank Harary; Uri Peled 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Coloring quasi-line graphs

✍ Maria Chudnovsky; Alexandra Ovetsky 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract A graph __G__ is a quasi‐line graph if for every vertex __v__, the set of neighbors of __v__ can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. A theorem of Shannon's implies that if __G__ is a line graph, then

Quasi-claw-free graphs

✍ A. Ainouche 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A graph G is quasi claw-free if it satisfies the property: This property is satisfied if in particular u does not center a claw (induced K1.3). Many known results on claw-free graphs, dealing with matching and hamiltonicity are extended to the larger class of quasi-claw-free graphs.

Recognizing quasi-triangulated graphs

✍ Jeremy P Spinrad 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 206 KB

This paper discusses a method for recognizing certain graph classes based on elimination schemes more e ciently. We reduce the time bound for recognizing quasi-triangulated graphs from O(n 3 ) to O(n 2:77 ), and perfect elimination bipartite and cop-win graphs from O(n 3 ) to O(n 3 =log n).