Counting Interval Graphs

DOI10.2307/1998705zbMath0519.05039OpenAlexW4253944265MaRDI QIDQ3669449

Philip J. Hanlon

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/1998705

zbMATH Keywords

interval graphisomorphism classeslabelled interval graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items

Uniquely orderable interval graphs, Counting interval orders, Some methods for computing component distribution probabilities in relational structures, Algorithmic aspects of intersection graphs and representation hypergraphs, Succinct encodings for families of interval graphs, A Model for Birdwatching and other Chronological Sampling Activities, Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number, Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs, On the enumeration of interval graphs, Unnamed Item, Height counting of unlabeled interval and \(N\)-free posets., Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs, Minimal obstructions for partial representations of interval graphs, Counting endpoint sequences for interval orders and interval graphs, Exact counting of unlabeled rigid interval posets regarding or disregarding height, Riordan matrices and higher-dimensional lattice walks, Computing the boxicity of a graph by covering its complement by cointerval graphs, Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs, Arithmetical semigroups related to trees and polyhedra, Catalan, Motzkin, and Riordan numbers, Interval graphs and related topics, Interval graphs and interval orders, Counting labelled chordal graphs, A characterization of uniquely representable interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
• On double and multiple interval graphs
• Representation of a finite graph by a set of intervals on the real line
• Monotone sequences of graphical invariants
• Extremal Values of the Interval Number of a Graph
• Asymptotic Methods in Enumeration
• A Characterization of Comparability Graphs and of Interval Graphs