Multi-interval pairwise compatibility graphs (extended abstract)
From MaRDI portal
Recommendations
Cites work
- A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
- Graph Drawing
- On graphs that are not PCGs
- On relaxing the constraints in pairwise compatibility graphs
- On the pairwise compatibility property of some superclasses of threshold graphs
- On-line maintenance of triconnected components with SPQR-trees
- Output-sensitive reporting of disjoint paths
- Pairwise compatibility graphs
- Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
Cited in
(10)- New results on pairwise compatibility graphs
- Exact-2-relation graphs
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
- scientific article; zbMATH DE number 840682 (Why is no real title available?)
- A survey on pairwise compatibility graphs
- Pairwise Compatibility Graphs
- On star-multi-interval pairwise compatibility graphs
- All graphs with at most 8 nodes are 2-interval-PCGs
- On generalizations of pairwise compatibility graphs
- On star-k-PCGs: exploring class boundaries for small k values
This page was built for publication: Multi-interval pairwise compatibility graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988811)