Determining the interval number of a triangle-free graph

DOI10.1007/BF02251237zbMath0516.05058OpenAlexW265217604MaRDI QIDQ1052345

Christoph Maas

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02251237

zbMATH Keywords

intersection graphalgorithmic determination of the interval number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (4)

On an extremal problem concerning the interval number of a graph ⋮ Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ On the unit interval number of a graph ⋮ Representations of graphs and networks (coding, layouts and embeddings)

Cites Work

• Unnamed Item
• Unnamed Item
• Some results about the interval number of a graph
• A lower bound for the interval number of a graph
• 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: Determining the interval number of a triangle-free graph