On the enumeration of minimal non-pairwise compatibility graphs

DOI10.1007/s10878-021-00799-xzbMath1504.90108OpenAlexW4255530208MaRDI QIDQ5918527

Aleksandar Shurbevski, Naveed Ahmed Azam, Hiroshi Nagamochi

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00799-x

zbMATH Keywords

branch-and-bound algorithmlinear programmingpairwise compatibility graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Exploring pairwise compatibility graphs
• A method for enumerating pairwise compatibility graphs with a given number of vertices
• Some classes of graphs that are not PCGs
• Some reduction operations to pairwise compatibility graphs
• Practical graph isomorphism. II.
• On graphs that are not PCGs
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise Compatibility Graphs: A Survey
• On the enumeration of minimal non-pairwise compatibility graphs

This page was built for publication: On the enumeration of minimal non-pairwise compatibility graphs