Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039): Difference between revisions
From MaRDI portal
Revision as of 10:50, 6 June 2024
scientific article
| 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 |
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
