The interval number of a planar graph: Three intervals suffice
From MaRDI portal
Publication:786830
DOI10.1016/0095-8956(83)90050-3zbMATH Open0528.05053OpenAlexW2071261821WikidataQ106159534 ScholiaQ106159534MaRDI QIDQ786830FDOQ786830
Authors: Edward Scheinerman, Douglas B. West 
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90050-3
Cites Work
- Construction of ternary \(H_v\)-groups and ternary \(P\)-hyperoperations.
- On double and multiple interval graphs
- Extremal Values of the Interval Number of a Graph
- Title not available (Why is that?)
- Recognizing graphs with fixed interval number is NP-complete
- Extremal values of the interval number of a graph, II
- Title not available (Why is that?)
- The interval number of a complete multipartite graph
Cited In (29)
- The total interval number of a graph
- Localized and compact data-structure for comparability graphs
- Caterpillar arboricity of planar graphs
- Scheduling split intervals with non-uniform demands
- On the interval number of random graphs
- Recognizing graphs with fixed interval number is NP-complete
- Subtree and substar intersection numbers
- The interval number of a planar graph is at most three
- On an extremal problem concerning the interval number of a graph
- Interval numbers of powers of block graphs
- A note on the interval number of a graph
- On interval representations of graphs
- Representation of Planar Hypergraphs by Contacts of Triangles
- Interval representations of planar graphs
- On the parameterized complexity of multiple-interval graph problems
- On the bend-number of planar and outerplanar graphs
- Distance Labeling for Permutation Graphs
- Some new results on bar visibility of digraphs
- On the unit interval number of a graph
- Edge-intersection graphs of grid paths: the bend-number
- Three ways to cover a graph
- Fast diameter computation within split graphs
- On star and caterpillar arboricity
- Irredundancy in multiple interval representations
- On the planar split thickness of graphs
- Tree loop graphs
- On grid intersection graphs
- On the interval number of special graphs
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: The interval number of a planar graph: Three intervals suffice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786830)
