zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Extensions of permutation and interval graphs. (English) Zbl 0652.05055
Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 58, 267-275 (1987).

[For the entire collection see Zbl 0638.00009.]

Permutation graphs may be represented by a permutation diagram consisting of two parallel lines where one line has points numbered from 1 to n (the order of the graph) and the other line has points numbered by a permutation π of (1,...,n). Vertex i is adjacent to vertex j iff the line joining the two i points intersects the line joining the two j points. We extend this notion to PI and II graphs in the following way: For a PI graph each vertex is represented by a point on one line and an interval on the other. Two vertices are adjacent iff their corresponding triangles intersect. In an II graph each vertex is represented by an interval on each line and two vertices are adjacent iff their corresponding trapezoids intersect. This extends the notion of Interval graphs where all intervals are on one line and two vertices are adjacent iff their corresponding intervals intersect. In this paper we illustrate some properties of PI and II graphs with respect to various classes of perfect graphs.

05C99Graph theory