Counting Interval Graphs
From MaRDI portal
Publication:3669449
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Asymptotic Methods in Enumeration
- Extremal Values of the Interval Number of a Graph
- Monotone sequences of graphical invariants
- On double and multiple interval graphs
- Representation of a finite graph by a set of intervals on the real line
- 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
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Counting labelled chordal graphs
- A Model for Birdwatching and other Chronological Sampling Activities
- Height counting of unlabeled interval and \(N\)-free posets.
- Moduli spaces of geometric graphs
- 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
- Interval graphs and related topics
- Arithmetical semigroups related to trees and polyhedra
- 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
- Algorithmic aspects of intersection graphs and representation hypergraphs
- On the enumeration of interval graphs
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Minimal obstructions for partial representations of interval graphs
- Counting interval orders
- Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
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)
