On representing an interval graph using the minimum number of interval lengths
From MaRDI portal
Publication:2918474
zbMATH Open1251.05112MaRDI QIDQ2918474FDOQ2918474
Authors: Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme L. Szwarcfiter
Publication date: 6 October 2012
Published in: Matemática Contemporânea (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cited In (9)
- Minimal interval completion through graph exploration
- Graphs of interval count two with a given partition
- Title not available (Why is that?)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries
- Interval count of generalizations of threshold graphs
- Realizing Interval Graphs with Size and Distance Constraints
- On the non-unit count of interval graphs
- Minimal obstructions for partial representations of interval graphs
- On subclasses of interval count two and on Fishburn's conjecture
This page was built for publication: On representing an interval graph using the minimum number of interval lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918474)