| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650621 | Discrete Mathematics | 2006 | 12 Pages |
Abstract
A graph is a P4P4-comparability graph if it admits an acyclic orientation of its edges which is transitive on every chordless path on four vertices. We give a characterization of P4P4-comparability graphs in terms of an auxiliary graph being bipartite.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Celina de Figueiredo, Chính T. Hoàng, Frédéric Maffray,