𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of recognizing a class of perfectly orderable graphs

✍ Scribed by Chính T. Hoàng

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
484 KB
Volume
66
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A charming class of perfectly orderable
A charming class of perfectly orderable graphs
✍ Chính T. Hoàng; Frédéric Maffray; Stephan Olariu; Myriam Preissmann 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 539 KB

We investigate the following conjecture of VaSek Chvatal: any weakly triangulated graph containing no induced path on five vertices is perfectly orderable. In the process we define a new polynomially recognizable class of perfectly orderable graphs called charming. We show that every weakly triangul

Quasi-brittle graphs, a new class of per
Quasi-brittle graphs, a new class of perfectly orderable graphs
✍ Stephan Olariu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 893 KB

A graph G is quasi-brittle if every induced subgraph H of G contains a vertex which is incident to no edge extending symmetrically to a chordless path with three edges in either H or its complement 8. The quasi-britiie graphs turn out to be a natural generalization of the well-known class of brittle

Some classes of perfectly orderable grap
Some classes of perfectly orderable graphs
✍ C. T. Hoàng; B. A. Reed 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 815 KB

In 1981, Chvatal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs and the triangulated graphs. In this paper, we introduce four classes of perfectly orderable graphs, including natural generalizations of the comparability and triangulate

Four classes of perfectly orderable grap
Four classes of perfectly orderable graphs
✍ V. Chvátal; C. T. Hoàng; N. V. R. Mahadev; D. De Werra 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 638 KB

A graph is called "perfectly orderable" if its vertices can be ordered in such a way that, for each induced subgraph F, a certain "greedy" coloring heuristic delivers an optimal coloring of F. No polynomial-time algorithm to recognize these graphs is known. We present four classes of perfectly order