Paper: Graphs of unbounded linear cliquewidth must transduce all trees (at LICS 2025)

Authors: Mikolaj Bojanczyk Pierre Ohlmann

Abstract

No Abstract Available

BibTeX

  @InProceedings{BojanczykOhlmann-Graphsofunboundedli,
    author = 	 {Mikolaj Bojanczyk and Pierre Ohlmann},
    title = 	 {Graphs of unbounded linear cliquewidth must transduce all trees},
    booktitle =  {Proceedings of the Fortieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2025)},
    year =	 {2025},
    month =	 {June}, 
    pages =      {691--703},
    location =   {Singapore}, 
    publisher =	 {ACM}
  }