1993/03/01 by Jürgen Eckhoff · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Graph theory and applications #Combinatorics #Mathematics #Indifference graph #Interval (graph theory) #Chordal graph #Split graph #Interval graph #Discrete mathematics #Clique number #Clique-sum #Clique #Cograph #Block graph #Pathwidth #Graph #1-planar graph #Line graph
paper · doi:10.1002/jgt.3190170112
openalex publication_date 1993/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
Abstract An interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs. © 1993 John Wiley & Sons, Inc.