Pairwise compatibility graphs: complete characterization for wheels

DOI10.2140/involve.2019.12.871zbMath1414.05097OpenAlexW2945026605MaRDI QIDQ2424298

Yanyan Li

Publication date: 24 June 2019

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2019.12.871

zbMATH Keywords

wheelphylogenetic treePCGpairwise compatibility graph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Structure and linear time recognition of 3-leaf powers
• Pairwise compatibility graphs
• Characterizations of strongly chordal graphs
• Graphs that are not pairwise compatible: a new proof technique (extended abstract)
• Neighborhood subtree tolerance graphs
• Some remarks about leaf roots
• On graphs that are not PCGs
• On pairwise compatibility graphs having Dilworth number two
• ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise Compatibility Graphs: A Survey
• Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs
• Structure and linear-time recognition of 4-leaf powers
• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

This page was built for publication: Pairwise compatibility graphs: complete characterization for wheels