Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graphs that are not pairwise compatible: a new proof technique (extended abstract)

From MaRDI portal
Publication:1670981
Jump to:navigation, search

DOI10.1007/978-3-319-94667-2_4OpenAlexW2810237777MaRDI QIDQ1670981

Rossella Petreschi, Pierluigi Baiocchi, Angelo Monti, Tiziana Calamoneri

Publication date: 6 September 2018

Full work available at URL: http://hdl.handle.net/11573/1196775


zbMATH Keywords

pairwise compatibility graphs (PCGs)PCG Recognition problemPhylogenetic Tree Reconstruction problem


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)


Related Items (3)

Pairwise compatibility graphs: complete characterization for wheels ⋮ Exact-2-relation graphs ⋮ A survey on pairwise compatibility graphs




This page was built for publication: Graphs that are not pairwise compatible: a new proof technique (extended abstract)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1670981&oldid=13984040"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki