New Reducible Configurations for Graph Multicoloring with Application to the Experimental Resolution of McDiarmid-Reed's Conjecture
A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general handle reduction methods for $(a,b)$-coloring of graphs for $2\le a/b\le 3$. In particular, using necessary and suffi...
Saved in:
| Published in: | Journal of graph algorithms and applications Vol. 29; no. 1; pp. 267 - 288 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.10.2025
|
| ISSN: | 1526-1719, 1526-1719 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!