Edge coloring of small signed graphs
In 2020, Behr introduced the problem of edge coloring of signed graphs and proved that every signed graph (G, sigma) can be colored using Delta(G) or Delta(G) + 1 colors, where Delta(G) denotes the maximum degree of G. Three years later, Janczewski et al. introduced a notion of signed class 1, such...
| Glavni autori: | , , |
|---|---|
| Format: | Članak |
| Jezik: | English |
| Izdano: |
Gdańsk University of Technology
2025-01-01
|
| Serija: | TASK Quarterly |
| Teme: | |
| Online pristup: | https://journal.mostwiedzy.pl/TASKQuarterly/article/view/3071 |