Representation theorems for graphs whose the vertex set is partially ordered |
| |
| Affiliation: | Laboratoire ARTEMIS, I.M.A.G., 38402 St Martin d''Heres, France |
| |
| Abstract: | Given a graph G = (X, E), we try to know when it is possible to consider G as the intersection graph of a finite hypergraph, when some restrictions are given on the inclusion order induced on the edge set of this hypergraph.We give some examples concerning the interval graphs and the circular graphs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
