Author of the publication

Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number.

, and . J. Graph Theory, 78 (1): 61-79 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

LBFS Orderings and Cocomparability Graphs., , and . SODA, page 883-884. ACM/SIAM, (1999)Asteroidal Triple-Free Graphs., , and . WG, volume 790 of Lecture Notes in Computer Science, page 211-224. Springer, (1993)Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time., , and . WADS, volume 955 of Lecture Notes in Computer Science, page 358-368. Springer, (1995)Parallel Computations in Graph Theory, and . FOCS, page 13-18. IEEE Computer Society, (1975)On pseudosimilarity in trees., , and . J. Comb. Theory B, 34 (3): 323-339 (1983)Stable Set Bonding in Perfect Graphs and Parity Graphs., and . J. Comb. Theory B, 59 (1): 1-14 (1993)The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract)., , and . SODA, page 175-180. ACM/SIAM, (1998)Collective Tree Spanners and Routing in AT-free Related Graphs., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 68-80. Springer, (2004)On the Relationship between Clique-Width and Treewidth., and . WG, volume 2204 of Lecture Notes in Computer Science, page 78-90. Springer, (2001)Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number., and . J. Graph Theory, 78 (1): 61-79 (2015)