Chronological orderings of interval graphs
From MaRDI portal
Publication:795848
DOI10.1016/0166-218X(84)90080-5zbMATH Open0543.05059OpenAlexW1973007407WikidataQ127498886 ScholiaQ127498886MaRDI QIDQ795848FDOQ795848
Authors: Dale Skrien 
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(84)90080-5
Recommendations
Cites Work
- Title not available (Why is that?)
- Incidence matrices, interval graphs and seriation in archeology
- A Characterization of Comparability Graphs and of Interval Graphs
- Title not available (Why is that?)
- The complexity of comparability graph recognition and coloring
- Comparability graphs and a new matroid
- A recognition algorithm for the intersection graphs of paths in trees
- Title not available (Why is that?)
- Chronological orderings of interval graphs
Cited In (23)
- A characterization of uniquely representable interval graphs
- Minimal obstructions for partial representations of interval graphs
- Chronological Orderings of Interval Digraph
- Characterisations of intersection graphs by vertex orderings
- Counting endpoint sequences for interval orders and interval graphs
- Interval graph representation with given interval and intersection lengths
- Chronological orderings of interval graphs
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Graphs of interval count two with a given partition
- Unit and single point interval graphs
- Two problems on interval counting
- On the classes of interval graphs of limited nesting and count of lengths
- End vertices in interval graphs
- Recognition and characterization of chronological interval digraphs
- Chronological orderings of interval digraphs
- Interval graphs and related topics
- On the non-unit count of interval graphs
- On interval graphs and matrice profiles
- Semi-proper interval graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Chronological rectangle digraphs which are two-terminal series-parallel
- On subclasses of interval count two and on Fishburn's conjecture
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: Chronological orderings of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795848)
