Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492870
DOI10.1007/11549345zbMath1156.05338OpenAlexW2494705596MaRDI QIDQ5492870
Jiří Fiala, Jan Arne Telle, Daniël Paulusma
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Related Items
An universality argument for graph homomorphisms, Unnamed Item, Universality of intervals of line graph order, Subexponential algorithms for variants of the homomorphism problem in string graphs