scientific article; zbMATH DE number 4027515
There are known many necessary and sufficient conditions for a graph to be an interval graph (e.g. C. C. Lekkerkerker's and J. Ch. Boland's, P. C. Gilmore's and J. J. Hoffman's, B. G. Mirkinn's and S. N. Rodin's). The author gives some new structural properties of interval graphs. The results are described using the denotation I(x) for a set of all vertices which are adjacent to a vertex x (in a graph G) and many other special denotations. Theorem 1. Let \(G=(X,E)\) be the complementary graph of an interval graph. If a,b\(\in X\), \(a\not\in I(b)\) then I(x)\(\supset I(b)\setminus I(a)\), for all \(x\in I(a)\setminus I(b).\) Theorem 2. If \(G=(X,E)\) is a simple nonoriented graph and I(a)\(\supset I(b)\) or I(b)\(\supset I(a)\) for all a,b\(\in X\), \(a\not\in I(b)\) then G is the complementary graph of an interval graph. We omit the theorems 3, 4 using special denotations.
- A note on the interval number of a graph
- A note on graphs and rational balls
- A note on the interval function of a disconnected graph
- Consecutive retrieval property -- revisited
- On unit interval graphs with integer endpoints
- scientific article; zbMATH DE number 3875337 (Why is no real title available?)
- On certain extensions of intervals in graphs
- Interval Graphs with Containment Restrictions
- scientific article; zbMATH DE number 4043897 (Why is no real title available?)
- scientific article; zbMATH DE number 4053674 (Why is no real title available?)
- scientific article; zbMATH DE number 4095511 (Why is no real title available?)
- scientific article; zbMATH DE number 637320 (Why is no real title available?)
- scientific article; zbMATH DE number 1923007 (Why is no real title available?)
- scientific article; zbMATH DE number 4418 (Why is no real title available?)
- scientific article; zbMATH DE number 6010 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768935)