On interval representations of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1185295 (Why is no real title available?)
- Caterpillar arboricity of planar graphs
- On star and caterpillar arboricity
- On the interval number of special graphs
- On the maximum average degree and the oriented chromatic number of a graph
- Recognizing d-interval graphs and d-track interval graphs
- Recognizing graphs with fixed interval number is NP-complete
- The Complexity of Multiterminal Cuts
- The interval number of a planar graph: Three intervals suffice
- Three ways to cover a graph
Cited in
(16)- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- On graph algebras from interval maps
- Recognizing graphs with fixed interval number is NP-complete
- The interval number of a planar graph is at most three
- Track number of line graphs
- Regular set of representatives for time-constrained MSC graphs
- scientific article; zbMATH DE number 927077 (Why is no real title available?)
- scientific article; zbMATH DE number 1923007 (Why is no real title available?)
- Succinct encodings for families of interval graphs
- Realizing Interval Graphs with Size and Distance Constraints
- scientific article; zbMATH DE number 1185295 (Why is no real title available?)
- scientific article; zbMATH DE number 701114 (Why is no real title available?)
- Interval Graphs with Containment Restrictions
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
- Minimal obstructions for partial representations of interval graphs
- Fully dynamic representations of interval graphs
This page was built for publication: On interval representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962513)