Some results about the interval number of a graph (Q788005): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1229887 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Štefan Znám / rank | |||
Normal rank |
Revision as of 17:28, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some results about the interval number of a graph |
scientific article |
Statements
Some results about the interval number of a graph (English)
0 references
1983
0 references
A family \((I_ i)^ n_{i=1}\) of sets with every \(I_ i\) being the union of at most m intervals of the real line is called an m-interval model of the graph G if G is the intersection graph of \((I_ i)\). The smallest integer m for which G has an m-interval model is called the interval number i(G) of G. The present paper gives a lower bound for i(G) and further an idea for algorithmical determination of i(G) for a class of graphs G. The considerations can be applied in scheduling problems.
0 references
interval number
0 references
triangle-free graphs
0 references
intersection graph
0 references