| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657190 | Journal of Combinatorial Theory, Series B | 2012 | 32 Pages |
Abstract
We still do not know how to construct the “most general” perfect graph, not even the most general three-colourable perfect graph. But constructing all perfect graphs with no even pairs seems easier, and here we make a start on it; we construct all three-connected three-colourable perfect graphs without even pairs and without clique cutsets. They are all either line graphs of bipartite graphs, or complements of such graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
