English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

MPS-Authors
/persons/resource/persons98366

Schmid,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

http://drops.dagstuhl.de/opus/volltexte/2019/10258/
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Chalermsook, P., Schmid, A., & Uniyal, S. (2019). A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. In R. Niedermeier, & C. Paul (Eds.), 36th Symposium on Theoretical Aspects of Computer Science (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.STACS.2019.19.


Cite as: https://hdl.handle.net/21.11116/0000-0002-E5D6-A
Abstract
There is no abstract available