✦ LIBER ✦

Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam

✍ Scribed by Alejandro A. Schäffer

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 470 KB
Volume: 31
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90030-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On brittle graphs

✍ C. T. Hoàng; N. Khouzam 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Chvataf defined a graph G to be brittle if each induced subgraph F of G contains a vertex that is not a midpoint of any P4 or not an endpoint of any P4. Every brittle graph is perfectly orderable. In this paper, we prove that a graph is brittle whenever it is HHD-free (containing no chordless cycle

On the complexity of recognizing a class

On the complexity of recognizing a class of perfectly orderable graphs

✍ Chính T. Hoàng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Remarks on a paper of Bachelis and Gilbe

Remarks on a paper of Bachelis and Gilbert

✍ Gerhard Racher 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 643 KB

Some Remarks on a Paper of G. Kohlstrung

✍ H. Henkes 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

Remarks on a paper of Gel'fand and S̆ilo

Remarks on a paper of Gel'fand and S̆ilov on Fourier transforms

✍ R.A. Zalik 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Remarks on a paper of C.G. Sinclair and

Remarks on a paper of C.G. Sinclair and K.J. McNaughton

✍ A. Pethö 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 170 KB