Pairwise compatibility graphs: a survey
From MaRDI portal
Publication:3186100
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) General topics of discrete mathematics in relation to computer science (68R01) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Signed and weighted graphs (05C22)
Recommendations
Cites work
- scientific article; zbMATH DE number 4053682 (Why is no real title available?)
- scientific article; zbMATH DE number 165077 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- Algorithms and Computation
- Characterising \((k,\ell )\)-leaf powers
- Characterizations of strongly chordal graphs
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
- Decomposition of graphical sequences and unigraphs
- Exact leaf powers
- Exploring pairwise compatibility graphs
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- NeST graphs
- Neighborhood subtree tolerance graphs
- On graph powers for leaf-labeled trees
- On graphs that are not PCGs
- On graphs that are not PCGs
- On k- Versus (k + 1)-Leaf Powers
- On pairwise compatibility graphs having Dilworth number \(k\)
- On pairwise compatibility graphs having Dilworth number two
- On relaxing the constraints in pairwise compatibility graphs
- On the pairwise compatibility property of some superclasses of threshold graphs
- Pairwise compatibility graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Rooted directed path graphs are leaf powers
- Some remarks about leaf roots
- Structure and linear time recognition of 3-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- The 3-Steiner Root Problem
- The complete inclusion structure of leaf power classes
- The number of caterpillars
- Threshold graphs and related topics
- Threshold tolerance graphs
- Tolerance graphs
- Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
Cited in
(29)- Exploring pairwise compatibility graphs
- On the enumeration of minimal non-pairwise compatibility graphs
- On the enumeration of minimal non-pairwise compatibility graphs
- A method for enumerating pairwise compatibility graphs with a given number of vertices
- Mim-width. III. Graph powers and generalized distance domination problems
- On relaxing the constraints in pairwise compatibility graphs
- Some classes of graphs that are not PCGs
- Some reduction operations to pairwise compatibility graphs
- A survey on pairwise compatibility graphs
- scientific article; zbMATH DE number 1844499 (Why is no real title available?)
- Recognition of linear and star variants of leaf powers is in P
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Linear-time recognition of double-threshold graphs
- Inferring phylogenetic trees from the knowledge of rare evolutionary events
- Discovering pairwise compatibility graphs
- New results on pairwise compatibility graphs
- Pairwise Compatibility Graphs
- Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
- Multi-interval pairwise compatibility graphs (extended abstract)
- A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
- Graphs that are not pairwise compatible: a new proof technique (extended abstract)
- Pairwise compatibility graphs
- Exact-2-relation graphs
- From modular decomposition trees to rooted median graphs
- Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees
- Pairwise compatibility graphs: complete characterization for wheels
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
This page was built for publication: Pairwise compatibility graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186100)
