Can I read P4-comparability graphs on EtoBox?
P4-comparability graphs by C.T. Hoàng; B.A. Reed is a Computer Science article available to read on EtoBox.
What is P4-comparability graphs about?
In 1981, Chv&tal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs. In this paper, we introduce a new class of perfectly orderable graphs, the &comparability graphs. This class generalizes comparability graphs in a natural way. We also prove a decomposition theorem which leads to a structural characterization of &comparability graphs. Using this characterization, we develop a polynomial-time recognition algorithm and polynomial-time algorithms for the clique and colouring problems for &comparability graphs.
Who reads P4-comparability graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- C.T. Hoàng; B.A. Reed
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 1989
- Language
- EN
- Field
- Computer Science (Physical Sciences)