Comparing Universal Covers in Polynomial Time

DOI10.1007/978-3-540-79709-8_18zbMath1142.68456MaRDI QIDQ3503635

Daniël Paulusma, Jiří Fiala

Publication date: 5 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/7420/1/7420.pdf

Mathematics Subject Classification ID

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

90C59: Approximation methods and heuristics in mathematical programming

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Comparing universal covers in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete complexity classification of the role assignment problem
• Finite common coverings of graphs
• Role colouring a graph
• Computing Boolean functions on anonymous networks
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Covering regular graphs
• Locally constrained graph homomorphisms and equitable partitions
• Homomorphisms of derivative graphs
• Constructing 5-Arc-Transitive Cubic Graphs
• Partial covers of graphs
• Fixed-parameter complexity of \(\lambda\)-labelings