✦ LIBER ✦

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable

✍ Scribed by Mostafa Blidia; Konrad Engel

Publisher: Springer Japan
Year: 1992
Tongue: English
Weight: 273 KB
Volume: 8
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02350628

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New properties of perfectly orderable gr

New properties of perfectly orderable graphs and strongly perfect graphs

✍ Chính T. Hoàng; Frédéric Maffray; Myriam Preissmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 893 KB

Which line-graphs are perfectly orderabl

Which line-graphs are perfectly orderable?

✍ V. Chvátal 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB

## Abstract We characterize (by forbidden induced subgraphs) those line‐graphs that are perfectly orderable. Implicit in our presentation is a polynomial, time algorithm for recognizing these graphs.

Almost all Cayley graphs are hamiltonian

✍ Meng Jixiang; Huang Qiongxiang 📂 Article 📅 1996 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 278 KB