𝔖 Bobbio Scriptorium
✦   LIBER   ✦

All variations on perfectly orderable graphs

✍ Scribed by Stephan Olariu

Book ID
107884271
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
484 KB
Volume
45
Category
Article
ISSN
0095-8956

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.