MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Bull-free weakly triangulated perfectly orderable graphs (1998) [3 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Ryan B. Hayward
http://www.cs.uleth.ca/~hayward/papers/bull98.ps
Add To MetaCart

Abstract:

Abstract. Using doubly lexical orders and the notion of box partition due to de Figueiredo, Maffray, and Porto, we show that a certain subclass of bull-free weakly triangulated graphs is perfectly orderable. This together with results of de Figueiredo, Maffray, and Porto confirms Chv'atal's conjecture that bull-free graphs with no anti-hole and no odd hole are perfectly orderable; here hole means induced cycle with five or more vertices.

Citations

80 Optimizing weakly triangulated graphs – Hayward, Hoàng, et al. - 1989
35 Doubly lexical ordering of matrices – Lubiw - 1987
25 On the complexity of recognizing perfectly orderable graphs – Middendorf, Pfeiffer - 1990
20 On brittle graphs – Ho`ang, Khouzam - 1988
19 Characterizations of totally balanced matrices – Anstee, Farber - 1984
14 Totally balanced and greedy matrices – Hoffman, Kolen, et al. - 1985
12 On the complexity of recognizing a class of perfectly orderable graphs – Hoàng - 1996
4 Perfectly orderable graphs, in "Topics on Perfect Graphs – Chv'atal - 1984
3 On the structure of bull-free perfect graphs, 2: the weakly triangulated case, RUTCOR – Figueiredo, Maffray, et al. - 1994
2 A class of perfectly orderable graphs, Rpt. 89573-OR, Forschungsinstitut fur Diskrete Mathematik – Chv'atal - 1989
2 On the perfect orderability of unions of two graphs – Ho`ang
1 Optimizing bull-free perfect graphs", manuscript – Figueiredo, Maffray - 1997
1 On the structure of bull-free perfect graphs", Graphs and Combinatorics 13 – Figueiredo, Maffray, et al. - 1997
View or Download | Add to My Collection | Correct Errors