Document Type

Article

Publication Date

1989

DOI

10.1016/0012-365x(89)90208-2

Publication Title

Discrete Mathematics

Volume

74

Issue

1-2

Pages

159-171

Abstract

We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm, together with linear-time optimization algorithms for this class of graphs.

Comments

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

Original Publication Citation

Olariu, S. (1989). Weak bipolarizable graphs. Discrete Mathematics, 74(1-2), 159-171. doi:10.1016/0012-365x(89)90208-2

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS