Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification (Q7207783)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification |
scientific article from arXiv |
Statements
math.CO
0 references
2026
0 references
