A sharp edge bound on the interval number of a graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199910)32:2<153::AID-JGT5>3.0.CO;2-P" /><153::AID-JGT5>3.0.CO;2-P 10.1002/(SICI)1097-0118(199910)32:2<153::AID-JGT5>3.0.CO;2-PzbMath0930.05067OpenAlexW4234273441MaRDI QIDQ4700529

József Balogh, András Pluhár

Publication date: 30 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199910)32:2<153::aid-jgt5>3.0.co;2-p

zbMATH Keywords

intersection graphinterval numberinterval representationdisplayed segment

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ On the interval number of special graphs ⋮ Interval numbers of powers of block graphs ⋮ The interval number of a planar graph is at most three ⋮ Minimum difference representations of graphs

Cites Work

• Lehmans switching game and a theorem of Tutte and Nash-Williams

This page was built for publication: A sharp edge bound on the interval number of a graph