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 QIDQ6496545zbMATH OpenFDO

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

Publication date 3 May 2024

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5158488 (Why is no real title available?)
• scientific article; zbMATH DE number 3735856 (Why is no real title available?)
• scientific article; zbMATH DE number 91031 (Why is no real title available?)
• scientific article; zbMATH DE number 512941 (Why is no real title available?)
• scientific article; zbMATH DE number 1107736 (Why is no real title available?)
• scientific article; zbMATH DE number 2081019 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 7724194 (Why is no real title available?)
• Algorithmic aspects of regular graph covers with applications to planar graphs
• An Efficient Algorithm for Graph Isomorphism
• Compatible 2-factors
• Complexity of graph covering problems
• Complexity of hypergraph coloring and Seidel's switching.
• Computational complexity of covering disconnected multigraphs
• Computational complexity of covering three-vertex multigraphs
• Constructing 5-Arc-Transitive Cubic Graphs
• Covering regular graphs
• Coverings and minors: Application to local computations in graphs
• Elementary abelian covers of graphs
• Graph labelings derived from models in distributed computing: A complete complexity classification
• Harmonic morphisms of graphs. Part I: Graph coverings
• Homological Coverings of Graphs
• Lifting graph automorphisms by voltage assignments
• List covering of regular multigraphs
• Local computations in graphs: the case of cellular edge local computations
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Locally injective homomorphism to the simple weight graphs
• Modular operads
• On the complexity of planar covering of small graphs
• Regular embeddings of canonical double coverings of graphs
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(1)

• Computational complexity of covering disconnected multigraphs

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)

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