Extremal values of the interval number of a graph, II

DOI10.1016/0012-365X(79)90183-3zbMath0454.05039OpenAlexW2049807202MaRDI QIDQ1149452

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 number of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

Extremal Values of the Interval Number of a Graph ⋮ Clique coverings of the edges of a random graph ⋮ Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ The total interval number of a graph ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy ⋮ On the parameterized complexity of multiple-interval graph problems ⋮ The interval number of a planar graph: Three intervals suffice ⋮ A lower bound for the interval number of a graph ⋮ Determining the interval number of a triangle-free 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