English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

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;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Chalermsook, P., Schmid, A., & Uniyal, S. (in press). A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. In 36th Symposium on Theoretical Aspects of Computer Science.


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