z-logo
Premium
An improved edge bound on the interval number of a graph
Author(s) -
Spinrad Jeremy R.,
Vijayan G.,
West Douglas B.
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110318
Subject(s) - combinatorics , mathematics , bounded function , upper and lower bounds , interval (graph theory) , vertex (graph theory) , graph , interval graph , discrete mathematics , line graph , 1 planar graph , mathematical analysis
The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here