Counting Interval Graphs
From MaRDI portal
Publication:3669449
DOI10.2307/1998705zbMATH Open0519.05039OpenAlexW4253944265MaRDI QIDQ3669449FDOQ3669449
Authors: Philip J. Hanlon 
Publication date: 1982
Full work available at URL: https://doi.org/10.2307/1998705
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representation of a finite graph by a set of intervals on the real line
- A Characterization of Comparability Graphs and of Interval Graphs
- Asymptotic Methods in Enumeration
- On double and multiple interval graphs
- Extremal Values of the Interval Number of a Graph
- Monotone sequences of graphical invariants
- The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
Cited In (27)
- A characterization of uniquely representable interval graphs
- Uniquely orderable interval graphs
- Counting endpoint sequences for interval orders and interval graphs
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs
- Riordan matrices and higher-dimensional lattice walks
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Title not available (Why is that?)
- Counting labelled chordal graphs
- A Model for Birdwatching and other Chronological Sampling Activities
- Moduli spaces of geometric graphs
- Height counting of unlabeled interval and \(N\)-free posets.
- Catalan, Motzkin, and Riordan numbers
- Interval graphs and interval orders
- Some methods for computing component distribution probabilities in relational structures
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- Succinct encodings for families of interval graphs
- Arithmetical semigroups related to trees and polyhedra
- Interval graphs and related topics
- On the proper interval completion problem within some chordal subclasses
- Exact counting of unlabeled rigid interval posets regarding or disregarding height
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- On the enumeration of interval graphs
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Minimal obstructions for partial representations of interval graphs
- Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
- Counting interval orders
This page was built for publication: Counting Interval Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3669449)
