On some subclasses of interval catch digraphs
From MaRDI portal
Publication:5081214
Recommendations
Cites work
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A characterization of interval catch digraphs
- A digraph represented by a family of boxes or spheres
- A short proof that `proper = unit'
- Algorithmic graph theory and perfect graphs
- Circular-arc bigraphs and its subclasses
- Classification using class cover catch digraphs
- Density of a random interval catch digraph family and its use for testing uniformity
- Domination number of an interval catch digraph family and its use for testing uniformity
- Forbidden substructure for interval digraphs/bigraphs
- Interval digraphs: An analogue of interval graphs
- Optimal greedy algorithms for indifference graphs
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
Cited in
(6)- scientific article; zbMATH DE number 5954122 (Why is no real title available?)
- A characterization of interval catch digraphs
- Algorithms for interval catch digraphs
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- On some subclasses of oriented catch digraphs
- scientific article; zbMATH DE number 434883 (Why is no real title available?)
This page was built for publication: On some subclasses of interval catch digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081214)