Document Type

Article

Publication Date

1993

DOI

10.1016/0012-365x(93)90513-s

Publication Title

Discrete Mathematics

Volume

113

Issue

1-3

Pages

143-153

Abstract

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 Hor its complement H¯. The quasi-brittle graphs turn out to be a natural generalization of the well-known class of brittle graphs. We propose to show that the quasi-brittle graphs are perfectly orderable in the sense of Chvátal: there exists a linear order < on their set of vertices such that no induced path with vertices a, b, c, d and edges ab, bc, cd has a < b and d < c.

Comments

Elsevier open archive. Copyright © 1993 Published by Elsevier B.V. All rights reserved.

Original Publication Citation

Olariu, S. (1993). Quasi-brittle graphs, a new class of perfectly orderable graphs. Discrete Mathematics, 113(1-3), 143-153. doi:10.1016/0012-365x(93)90513-s

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS