Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492870zbMATH OpenOpenAlexFDO

Authors Jiří Fiala, Daniël Paulusma, Jan Arne Telle

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

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Locally constrained graph homomorphisms and equitable partitions
• Graph-Theoretic Concepts in Computer Science
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Cantor--Bernstein type theorem for locally constrained graph homomorphisms
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree

Cited in

(7)

• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Locally constrained graph homomorphisms and equitable partitions
• An universality argument for graph homomorphisms
• scientific article; zbMATH DE number 7651213 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science
• Universality of intervals of line graph order
• Cantor--Bernstein type theorem for locally constrained graph homomorphisms

This page was built for publication: Mathematical Foundations of Computer Science 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492870)