✦ LIBER ✦

The Story of Perfectly Orderable Graphs

✍ Scribed by Ryan B. Hayward

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 58 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0708-1

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

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

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.

A note on perfectly orderable graphs

✍ Chinh T. Hoàng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 535 KB

On the complexity of recognizing perfect

On the complexity of recognizing perfectly orderable graphs

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 365 KB

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