C.T. Hoang, On the complexity of recognizing a class of perfectly orderable graphs, Discrete Applied Math. 66, 219-226, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Meyniel Weakly Triangulated Graphs I: Co-perfect orderability - Hayward (1997) (9 citations) (Correct)
....Drive, Lethbridge AB Canada T1K 3M4, e mail hayward cs.uleth.ca 2 Ryan B. Hayward, revised October 25, 1995 Not all weakly triangulated graphs are perfectly orderable; in fact, Ho ang has shown that recognizing perfectly orderable graphs remains NP complete for weakly triangulated inputs [Ho]. In 1990 Chv atal conjectured [C2] that every P 5 free weakly triangulated graph is perfectly orderable, where P k is the chordless path with k vertices. This conjecture is known to hold for various subclasses of P 5 free weakly triangulated graphs, namely ffl P 4 free graphs, ffl ....
C.T. Ho`ang, On the complexity of recognizing a class of perfectly orderable graphs, to appear in Discrete App. Math..
Bull-free Weakly Triangulated Perfectly Orderable Graphs - Hayward (1998) (2 citations) (Correct)
.... assigned the smallest color not already assigned to a neighbor) in the prescribed order yields an optimal coloring [C1] While many classes of graphs are known to be perfectly orderable, recognizing perfectly orderable graphs is NP complete [MP] and remains so even for weakly triangulated graphs [Ho]. In 1989, Chv atal conjectured that [C2] ffl every weakly triangulated graph with no P 5 is perfectly orderable, and ffl every bull free graph with no anti hole and no odd hole is perfectly orderable. Recently, we confirmed the first conjecture [Ha2] Here, we confirm the second. Our work ....
C.T. Ho`ang, On the complexity of recognizing a class of perfectly orderable graphs, to appear in Discrete App. Math..
Parallel Algorithms for Recognizing P_5-free and ...-free.. - Nikolopoulos, Palios (Correct)
No context found.
C.T. Hoang, On the complexity of recognizing a class of perfectly orderable graphs, Discrete Applied Math. 66, 219-226, 1996.
Recognizing HHD-free and Welsh-Powell Opposition Graphs - Nikolopoulos, Palios (Correct)
No context found.
C.T. Hoang, On the complexity of recognizing a class of perfectly orderable graphs, Discrete Appl. Math. 66, 219--226, 1996.
Recognizing Bipolarizable and P_4-simplicial Graphs - Nikolopoulos, Palios (Correct)
No context found.
C.T. Hoang, On the complexity of recognizing a class of perfectly orderable graphs, Discrete Appl. Math. 66, 219-226, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC