English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

MPS-Authors
/persons/resource/persons252863

Węgrzycki,  Karol       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

11095-PDF file-46418-2-10-20230915.pdf
(Publisher version), 639KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Nederlof, J., Pilipczuk, M., & Węgrzycki, K. (2023). Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. The Electronic Journal of Combinatorics, 30(3): P3.33. doi:10.37236/11095.


Cite as: https://hdl.handle.net/21.11116/0000-000C-1EF3-1
Abstract
There is no abstract available