A sharp edge bound on the interval number of a graph

DOI10.1002/(SICI)1097-0118(199910)32:2%3C153::AID-JGT5%3E3.0.CO;2-PzbMATH Open0930.05067OpenAlexW4234273441MaRDI QIDQ4700529FDOQ4700529

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%3C153::aid-jgt5%3E3.0.co;2-p

Recommendations

• An improved edge bound on the interval number of a graph
• Publication:4864784
• On an extremal problem concerning the interval number of a graph
• The interval number of dense graphs
• The total interval number of a graph

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)

Cites Work

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

Cited In (8)

• Minimum difference representations of graphs
• The interval number of a planar graph is at most three
• Interval numbers of powers of block graphs
• The interval number of dense graphs
• An improved edge bound on the interval number of a graph
• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
• On the interval number of special graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700529)