Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)

DOI10.1007/978-3-031-43380-1_8MaRDI QIDQ6496545

Michaela Seifrtová, Nikola Jedličková, Jan Bok, Jiří Fiala, Jan Kratochvíl

Publication date: 3 May 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Elementary abelian covers of graphs
• Computational complexity of covering three-vertex multigraphs
• Compatible 2-factors
• Coverings and minors: Application to local computations in graphs
• Covering regular graphs
• Lifting graph automorphisms by voltage assignments
• Regular embeddings of canonical double coverings of graphs
• Computational complexity of covering disconnected multigraphs
• List covering of regular multigraphs
• Locally Injective Homomorphism to the Simple Weight Graphs
• Graph labelings derived from models in distributed computing: A complete complexity classification
• On the Complexity of Planar Covering of Small Graphs
• Homological Coverings of Graphs
• Constructing 5-Arc-Transitive Cubic Graphs
• Modular operads
• Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
• An Efficient Algorithm for Graph Isomorphism
• SOFSEM 2005: Theory and Practice of Computer Science
• Graph-Theoretic Concepts in Computer Science
• Complexity of graph covering problems

This page was built for publication: Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)