Irredundancy in multiple interval representations

DOI10.1016/0012-365X(87)90157-9zbMath0624.05060MaRDI QIDQ1092070

Edward R. Scheinerman

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval numbert-interval grapht-interval representation of a graph

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (5)

Irredundancy in multiple interval representations ⋮ On the unit interval number of a graph ⋮ Interval numbers of powers of block graphs ⋮ On the interval number of random graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings)

Cites Work

• Recognizing graphs with fixed interval number is NP-complete
• The interval number of a planar graph: Three intervals suffice
• The interval number of a complete multipartite graph
• Irredundancy in multiple interval representations
• Extremal values of the interval number of a graph. II
• On double and multiple interval graphs
• Extremal Values of the Interval Number of a Graph

This page was built for publication: Irredundancy in multiple interval representations