✦ LIBER ✦

The total interval number of a graph

✍ Scribed by T Andreae; M Aigner

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 820 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90003-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The total interval number of a graph, I:

The total interval number of a graph, I: Fundamental classes

✍ Thomas M. Kratzke; Douglas B. West 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 906 KB

Kratzke, T.M. and D.B. West, The total interval number of a graph, I: Fundamental classes, Discrete Mathematics 118 (1993) 145-156. A multiple-interval representation of a simple graph G assigns each vertex a union of disjoint real intervals, such that vertices are adjacent if and only if their assi

The total interval number of a tree and

The total interval number of a tree and the Hamiltonian completion number of its line graph

✍ Arundhati Raychaudhuri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 672 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

On the interval number of a chordal grap

On the interval number of a chordal graph

✍ Edward R. Scheinerman 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB 👁 2 views

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum

Total interval number for graphs with bo

Total interval number for graphs with bounded degree

✍ Kostochka, Alexander V.; West, Douglas B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views

The total interval number of an n-vertex graph with maximum degree ∆ is at most (∆+1/∆)n/2, with equality if and only if every component of the graph is K ∆,∆ . If the graph is also required to be connected, then the maximum is ∆n/2 + 1 when ∆ is even, but when ∆ is odd it exceeds [∆ + 1/(2.5∆ + 7.7

A note on the interval number of a graph

✍ Paul Erdös; Douglas B. West 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Three results on the interval number of a graph on n vertices are presented. (1) The interval number of almost every graph is between n/4 Ig n and n/4 (this also holds for almost every bipartite graph). ( 2) There exist K+\_,, -free bipartite graphs with interval number at least c(m)n 1-2'Cm+1J/lg