Elsevier

Discrete Mathematics

Volume 306, Issue 22, 28 November 2006, Pages 2962-2963
Discrete Mathematics

Note
On a conjecture of Hoàng and Tu concerning perfectly orderable graphs

https://doi.org/10.1016/j.disc.2005.09.023Get rights and content
Under an Elsevier user license
open archive

Abstract

Hoàng and Tu [On the perfect orderability of unions of two graphs, J. Graph Theory 33 (2000) 32–43] conjectured that a weakly triangulated graph which does not contain a chordless path with six vertices is perfectly orderable. We present a counter example to this conjecture.

Keywords

Perfectly orderable graph
Weakly triangulated graph

Cited by (0)