Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 |
scientific article |
Statements
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (English)
0 references
8 December 2015
0 references
rainbow connection
0 references
edge coloring
0 references
forbidden subgraphs
0 references
