Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.05425MaRDI QIDQ5897549FDOQ5897549

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

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Mathematical Foundations of Computer Science 2005
• Locally constrained graph homomorphisms and equitable partitions
• Comparing universal covers in polynomial time
• Homomorphic image orders on combinatorial structures.
• An universality argument for graph homomorphisms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (3)

• Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
• Locally constrained graph homomorphisms and equitable partitions
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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