On combination and permutation graphs (Q2811827)
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: On combination and permutation graphs |
scientific article; zbMATH DE number 6592412
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On combination and permutation graphs |
scientific article; zbMATH DE number 6592412 |
Statements
10 June 2016
0 references
combination
0 references
permutation
0 references
strong \(k\)-combination
0 references
strong \(k\)-strong permutation graphs
0 references
On combination and permutation graphs (English)
0 references
The note extends previous work by other authors on the characterization of certain combination and permutation graphs. It gives some necessary conditions for a graph to be a combination graph, a permutation graph, a strong \(k\)-combination graph and a strong \(k\)-permutation graph. It also characterizes all maximal strong \(k\)-combination graphs of order less than 7.
0 references
