𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New properties of perfectly orderable graphs and strongly perfect graphs

✍ Scribed by Chính T. Hoàng; Frédéric Maffray; Myriam Preissmann

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
893 KB
Volume
98
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

s-strongly perfect cartesian product of
s-strongly perfect cartesian product of graphs
✍ Elefterie Olaru; Eugen Mǎndrescu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

## Abstract The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In “Perfect Product Graphs” (__Discrete Mathematics__, Vol. 20, 1977, pp. 177‐‐186), G. Ravindra and K. R.

New families of strongly regular graphs
New families of strongly regular graphs
✍ Yury J. Ionin; Hadi Kharaghani 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208–217, 2003; Published online in Wiley InterScience (www.interscience.wil