DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
From MaRDI portal
Publication:3084693
Recommendations
- Discovering pairwise compatibility graphs
- Exploring pairwise compatibility graphs
- Pairwise Compatibility Graphs
- Pairwise compatibility graphs
- Pairwise compatibility graphs: a survey
- A survey on pairwise compatibility graphs
- New results on pairwise compatibility graphs
- Multi-interval pairwise compatibility graphs (extended abstract)
- On relaxing the constraints in pairwise compatibility graphs
- Compatibility in a graph-theoretic setting
Cites work
Cited in
(19)- On the pairwise compatibility property of some superclasses of threshold graphs
- Pairwise Compatibility Graphs
- Pairwise compatibility graphs
- Selecting Complementary Pairs of Literals
- A survey on pairwise compatibility graphs
- A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
- On pairwise compatibility graphs having Dilworth number \(k\)
- Pairwise compatibility graphs: complete characterization for wheels
- On the enumeration of minimal non-pairwise compatibility graphs
- On the enumeration of minimal non-pairwise compatibility graphs
- Some reduction operations to pairwise compatibility graphs
- New results on pairwise compatibility graphs
- Multi-interval pairwise compatibility graphs (extended abstract)
- Pairwise compatibility graphs: a survey
- On pairwise compatibility graphs having Dilworth number two
- Some classes of graphs that are not PCGs
- On graphs that are not PCGs
- Discovering pairwise compatibility graphs
- scientific article; zbMATH DE number 1844499 (Why is no real title available?)
This page was built for publication: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084693)