Extremal interval graphs

DOI10.1002/jgt.3190170112zbMath0783.05058DBLPjournals/jgt/Eckhoff93OpenAlexW2018556604WikidataQ56267428 ScholiaQ56267428MaRDI QIDQ4693349

Jürgen Eckhoff

Publication date: 17 August 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170112

zbMATH Keywords

characterizationclique numberinterval graphcaterpillarsmaximum edge number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Related Items (10)

Coloring problem of signed interval graphs ⋮ Tverberg-type theorems with altered intersection patterns (nerves) ⋮ Efficient algorithm for the vertex connectivity of trapezoid graphs ⋮ A Model for Birdwatching and other Chronological Sampling Activities ⋮ On the hyperbolicity constant of circular-arc graphs ⋮ The Upper‐Bound Theorem for Families of Boxes in ℝ ^d ⋮ Intersection properties of boxes. II: Extremal families ⋮ Unnamed Item ⋮ On tree-partition-width ⋮ Mathematical properties on the hyperbolicity of interval graphs

Cites Work

• Interval graphs and interval orders
• A simple proof of the upper bound theorem
• On simple characterizations of k-trees
• Incidence matrices and interval graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item

This page was built for publication: Extremal interval graphs