Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling (Q1297493)
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: Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling |
scientific article; zbMATH DE number 1321856
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling |
scientific article; zbMATH DE number 1321856 |
Statements
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling (English)
0 references
10 April 2000
0 references
polynomial-time algorithm
0 references
partially 2-edge-colored graph
0 references
alternating walk
0 references
graph labeling
0 references
edge-labeling
0 references
regularizable index
0 references
