Belmonte, R., Harutyunyan, A., Köehler, N. orcid.org/0000-0002-1023-6530 et al. (1 more author) (2024) Odd chromatic number of graph classes. Journal of Graph Theory. ISSN 0364-9024
Metadata
| Item Type: | Article |
|---|---|
| Authors/Creators: |
|
| Copyright, Publisher and Additional Information: | © 2024 The Author(s). This is an open access article under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. |
| Keywords: | colouring variant, graph classes, odd colouring, upper bounds, vertex partition problem |
| Dates: |
|
| Institution: | The University of Leeds |
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity |
| Depositing User: | Symplectic Publications |
| Date Deposited: | 09 Sep 2024 10:32 |
| Last Modified: | 07 Nov 2024 14:45 |
| Status: | Published online |
| Publisher: | Wiley |
| Identification Number: | 10.1002/jgt.23200 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:216945 |
Download
Filename: Journal of Graph Theory - 2024 - Belmonte - Odd chromatic number of graph classes.pdf
Licence: CC-BY 4.0

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)