scientific article; zbMATH DE number 1236360
From MaRDI portal
Publication:4223772
Recommendations
- Complexity of graph covering problems
- scientific article; zbMATH DE number 2081019
- scientific article; zbMATH DE number 89406
- Complexity results for well‐covered graphs
- Computational complexity of covering cyclic graphs
- scientific article; zbMATH DE number 1454641
- scientific article; zbMATH DE number 811561
- Computational complexity of covering disconnected multigraphs
- Computational complexity of graphs
- On the computational complexity of optimization convex covering problems of graphs
Cited in
(46)- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On the weighted complexity of a regular covering of a graph
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
- An overview of graph covering and partitioning
- List covering of regular multigraphs
- A branch-and-cut algorithm for the maximum covering cycle problem
- The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Packing bipartite graphs with covers of complete bipartite graphs
- On the computational complexity of partial covers of theta graphs
- Computational complexity of covering three-vertex multigraphs
- Complexity of locally injective homomorphism to the Theta graphs
- 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
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Complexity results for well‐covered graphs
- Locally injective k-colourings of planar graphs
- scientific article; zbMATH DE number 89406 (Why is no real title available?)
- scientific article; zbMATH DE number 1107736 (Why is no real title available?)
- scientific article; zbMATH DE number 1953094 (Why is no real title available?)
- scientific article; zbMATH DE number 2081019 (Why is no real title available?)
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Partial covers of graphs
- scientific article; zbMATH DE number 2111730 (Why is no real title available?)
- Dichotomy of the H-quasi-cover problem
- Angle covers: algorithms and complexity
- Approximate lumpability for Markovian agent-based models using local symmetries
- Graph covering via shortest paths
- Overlaying a hypergraph with a graph with bounded maximum degree
- Block transitivity and degree matrices
- Computational complexity of covering cyclic graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- An algorithmic framework for locally constrained homomorphisms
- List covering of regular multigraphs with semi-edges
- scientific article; zbMATH DE number 7724194 (Why is no real title available?)
- Complexity of graph covering problems
- Loose cover of graphs
- An algorithmic framework for locally constrained homomorphisms
- Computational complexity of covering multigraphs with semi-edges: small cases
- Coverings of general digraphs
- A novel approach to covers of multigraphs with semi-edges
- The complexity of the covering radius problem
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- Mixed hypergraphs and other coloring problems
- Computational complexity of covering three-vertex multigraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223772)
