Extremal values of the interval number of a graph. II

DOI10.1016/0012-365X(79)90183-3zbMath0446.05027OpenAlexW2049807202MaRDI QIDQ1145706

Jerrold R. Griggs

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90183-3

zbMATH Keywords

intersection graphinterval numbercomplete bipartitefinite closed intervals

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (14)

On an extremal problem concerning the interval number of a graph ⋮ Irredundancy in multiple interval representations ⋮ On the interval number of special graphs ⋮ Forbidden submatrices ⋮ 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) ⋮ The total interval number of a graph. I: Fundamental classes ⋮ Subtree and substar intersection numbers ⋮ Recognizing graphs with fixed interval number is NP-complete ⋮ Some results about the interval number of a graph ⋮ The interval number of a complete multipartite graph ⋮ A note on the interval number of a graph

Cites Work

• Incidence matrices and interval graphs
• On double and multiple interval graphs
• Representation of a finite graph by a set of intervals on the real line
• Extremal Values of the Interval Number of a Graph
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Extremal values of the interval number of a graph. II