Computational complexity of covering disconnected multigraphs
From MaRDI portal
Publication:6633538
DOI10.1016/J.DAM.2024.07.035MaRDI QIDQ6633538
Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová
Publication date: 6 November 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lifting graph automorphisms by voltage assignments
- Bin packing with fixed number of bins revisited
- Computational complexity of covering disconnected multigraphs
- Harmonic morphisms of graphs. Part I: Graph coverings
- Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
- List covering of regular multigraphs with semi-edges
- Complexity of graph covering problems
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
This page was built for publication: Computational complexity of covering disconnected multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633538)
