✦ LIBER ✦

On an extremal problem concerning the interval number of a graph

✍ Scribed by Thomas Andreae

Book ID: 118389367
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 504 KB
Volume: 14
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90002-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal Values of the Interval Number o

Extremal Values of the Interval Number of a Graph

✍ Griggs, Jerrold R.; West, Douglas B. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 792 KB

On an extremal problem concerning the th

On an extremal problem concerning the theory of graphs

✍ Chong-Yun Chao 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 276 KB

Extremal values of the interval number o

Extremal values of the interval number of a graph, II

✍ Jerrold R. Griggs 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 315 KB

I i5 showll that the interval number of a gralh on n vertices is a~ inosl [I;(n ~ Ij], md this bound is best possible. This means that we can represent any l~raph ,,n n verl~cc~ as an intersection graph in which the sets ~ssigued Io the verUccs each ~or, sist of tlxe umorl ~a at m~st [~(n + I)] fini

An extremal problem in graph theory

✍ A. Ramachandra Rao 📂 Article 📅 1968 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 230 KB

On the unit interval number of a graph

✍ Thomas Andreae 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 552 KB

On the Interval Number of a Triangulated

On the Interval Number of a Triangulated Graph

✍ Thomas Andreae 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB 👁 2 views

The interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices u and w of G are adjacent if and only if some interval for u intersect