A New Conjecture About minimal Imperfect Graphs

Authors

H. Meyniel
Stephan Olariu, Old Dominion UniversityFollow

Document Type

Article

Publication Date

1989

DOI

10.1016/0095-8956(89)90024-5

Publication Title

Journal of Combinatorial Theory, Series B

Volume

47

Issue

2

Pages

244-247

Abstract

H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chordless path containing an odd number of edges. We conjectured that in every minimal imperfect graph, every pair of vertices is joined by a path containing an even number of edges. We give an equivalent version of this new conjecture.

Comments

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

Original Publication Citation

Meyniel, H., & Olariu, S. (1989). A new conjecture about minimal imperfect graphs. Journal of Combinatorial Theory, Series B, 47(2), 244-247. doi:10.1016/0095-8956(89)90024-5

Repository Citation

Meyniel, H., & Olariu, S. (1989). A new conjecture about minimal imperfect graphs. Journal of Combinatorial Theory, Series B, 47(2), 244-247. doi:10.1016/0095-8956(89)90024-5

ORCID

0000-0002-3776-216X (Olariu)