𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture of Hoàng and Tu concerning perfectly orderable graphs

✍ Scribed by Stefan Hougardy

Book ID
108113572
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
129 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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