Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class (Q6442467)
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: Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class |
scientific article; zbMATH DE number 900598559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class |
scientific article; zbMATH DE number 900598559 |
Statements
3 July 2023
0 references
math.CO
0 references
