𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing Planar Strict Quasi-Parity Graphs

✍ Scribed by Cláudia Linhares Sales; Frédéric Maffray; Bruce Reed

Book ID
106048062
Publisher
Springer Japan
Year
2001
Tongue
English
Weight
157 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing quasi-triangulated 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).

Perfectly orderable graphs are quasi-par
Perfectly orderable graphs are quasi-parity graphs: a short proof
✍ A. Hertz; D. de Werra 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 287 KB

%'c shw that perfectly orderabk grapk Sa are q&-parity graphs by exhibiting two &lodes which are not llinked by a chordless odd chain. This proof is short and simpler than the one given by H. Meynid.