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-PMaRDI QIDQ4700529zbMATH OpenOpenAlexFDO

Authors 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

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)

Recommendations

• An improved edge bound on the interval number of a graph
• scientific article; zbMATH DE number 846956
• On an extremal problem concerning the interval number of a graph
• The interval number of dense graphs
• The total interval number of a graph

Cites work

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

Cited in

(8)

• scientific article; zbMATH DE number 846956 (Why is no real title available?)
• 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

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)