Injective \(L(2,1)\)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs (Q3655461)
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: Injective L(2,1)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs |
scientific article; zbMATH DE number 5654624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Injective \(L(2,1)\)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs |
scientific article; zbMATH DE number 5654624 |
Statements
7 January 2010
0 references
dominoshold graphs
0 references
threshold graphs
0 references
couloring problem
0 references
\(L(2,1)\)-colouring
0 references
0.7439664602279663
0 references
0.723447322845459
0 references
0.7215019464492798
0 references
0.7158223390579224
0 references
0.7155198454856873
0 references
