The interval number of a planar graph: Three intervals suffice

DOI10.1016/0095-8956(83)90050-3MaRDI QIDQ786830zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

planar graphsinterval numberinterval graphinterval representation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3741433 (Why is no real title available?)
• scientific article; zbMATH DE number 3547322 (Why is no real title available?)
• Construction of ternary \(H_v\)-groups and ternary \(P\)-hyperoperations.
• Extremal Values of the Interval Number of a Graph
• Extremal values of the interval number of a graph, II
• On double and multiple interval graphs
• Recognizing graphs with fixed interval number is NP-complete
• The interval number of a complete multipartite graph

Cited in

(27)

• Representation of Planar Hypergraphs by Contacts of Triangles
• Some new results on bar visibility of digraphs
• The total interval number of a graph
• On interval representations of graphs
• On the interval number of special graphs
• On the interval number of random graphs
• On an extremal problem concerning the interval number of a graph
• On the unit interval number of a graph
• Irredundancy in multiple interval representations
• Caterpillar arboricity of planar graphs
• Fast diameter computation within split graphs
• Distance Labeling for Permutation Graphs
• Interval representations of planar graphs
• A note on the interval number of a graph
• 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
• Edge-intersection graphs of grid paths: the bend-number
• On star and caterpillar arboricity
• On the parameterized complexity of multiple-interval graph problems
• Tree loop graphs
• Representations of graphs and networks (coding, layouts and embeddings)
• Localized and compact data-structure for comparability graphs
• Three ways to cover a graph
• Interval numbers of powers of block graphs
• Scheduling split intervals with non-uniform demands
• On grid intersection graphs

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)