On the Complexity of Planar Covering of Small Graphs
From MaRDI portal
Publication:3104767
DOI10.1007/978-3-642-25870-1_9zbMath1341.05200arXiv1108.0064WikidataQ62048093 ScholiaQ62048093MaRDI QIDQ3104767
No author found.
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.0064
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
- On the complexity of H-coloring
- The spherical genus and virtually planar graphs
- Intersection graphs of curves in the plane
- Regular codes in regular graphs are difficult
- Intersection graphs of segments
- Covering regular graphs
- List-Coloring Squares of Sparse Subcubic Graphs
- On possible counterexamples to Negami's planar cover conjecture