Pages that link to "Item:Q5167767"
From MaRDI portal
The following pages link to Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (Q5167767):
Displaying 11 items.
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Some computational aspects of solvable regular covers of graphs (Q2343238) (← links)
- \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard (Q2628277) (← links)
- Jordan-like characterization of automorphism groups of planar graphs (Q2674344) (← links)
- (Q3115259) (← links)
- (Q3312267) (← links)
- Algorithms of optimal set covering on the planar R^2 (Q5266487) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
