A method for enumerating pairwise compatibility graphs with a given number of vertices (Q1983131)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A method for enumerating pairwise compatibility graphs with a given number of vertices |
scientific article; zbMATH DE number 7395739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method for enumerating pairwise compatibility graphs with a given number of vertices |
scientific article; zbMATH DE number 7395739 |
Statements
A method for enumerating pairwise compatibility graphs with a given number of vertices (English)
0 references
15 September 2021
0 references
pairwise compatibility graph
0 references
linear programming
0 references
Gale's theorem
0 references
branch-and-bound algorithm
0 references
graph isomorphism
0 references
