List covering of regular multigraphs

DOI10.1007/978-3-031-06678-8_17MaRDI QIDQ2169958

Jan Kratochvíl, Nikola Jedličková, Jan Bok, Paweł Rzążewski, Jiří Fiala

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2204.04280

Mathematics Subject Classification ID

68Wxx: Algorithms in computer science

68Rxx: Discrete mathematics in relation to computer science

Cites Work

• 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
• A complete complexity classification of the role assignment problem
• Computational complexity of covering three-vertex multigraphs
• Finite common coverings of graphs
• Generating all graph coverings by permutation voltage assignments
• Covering regular graphs
• Automorphisms of graphs and coverings
• Lifting graph automorphisms by voltage assignments
• 3-connected reduction for regular graph covers
• Regular embeddings of canonical double coverings of graphs
• Computational complexity of covering disconnected multigraphs
• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
• Antipodal covering graphs
• On the Complexity of Planar Covering of Small Graphs
• Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
• Labelling Graphs with a Condition at Distance 2
• Algebraic Graph Theory
• Modular operads
• NP completeness of the edge precoloring extension problem on bipartite graphs
• Complexity of locally-injective homomorphisms to tournaments
• Partial covers of graphs
• Revisiting Leighton’s theorem with the Haar measure
• Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs