Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Recognising the overlap graphs of subtrees of restricted trees is hard

From MaRDI portal
Publication:6621196
Jump to:navigation, search

MaRDI QIDQ6621196

Martin Pergel, Jessica Enright

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)




Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)








This page was built for publication: Recognising the overlap graphs of subtrees of restricted trees is hard

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6621196&oldid=40182572"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 19:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki