Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039)
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: Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers |
scientific article; zbMATH DE number 1977910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers |
scientific article; zbMATH DE number 1977910 |
Statements
Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (English)
0 references
9 September 2003
0 references
rotagraph
0 references
dynamic algorithm
0 references
\((2,1)\)-coloring
0 references
independence number
0 references
Cartesian product of graphs
0 references
strong product of graphs
0 references
0 references
0 references
0.8619997
0 references
0 references
0.85931283
0 references
0 references
0.8533758
0 references
0 references
0.85265315
0 references
0.8514948
0 references
