Pages that link to "Item:Q3031932"
From MaRDI portal
The following pages link to The graph genus problem is NP-complete (Q3031932):
Displayed 50 items.
- A note on approximating graph genus (Q290221) (← links)
- Total embedding distributions of Ringel ladders (Q409359) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- On the genus of the zero-divisor graph of \(\mathbb Z_n\) (Q471791) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679) (← links)
- Counting orientable embeddings by genus for a type of 3-regular graph (Q659758) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- Genus of the Cartesian product of triangles (Q888606) (← links)
- Embeddings of graphs with no short noncontractible cycles (Q916669) (← links)
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs (Q921011) (← links)
- The genus polynomials of cross-ladder digraphs in orientable surfaces (Q943439) (← links)
- Genus embeddings of a type of graph (Q949340) (← links)
- The genus of a type of graph (Q963700) (← links)
- On the embedding genus distribution of ladders and crosses (Q1021813) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Embeddings of graphs (Q1313840) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- On the orientable genus of graphs with bounded nonorientable genus (Q1379843) (← links)
- Orienting cycle elements in orientable rotation systems (Q1379983) (← links)
- Algorithmic graph embeddings (Q1391310) (← links)
- Blocking nonorientability of a surface (Q1403908) (← links)
- A relative maximum genus graph embedding and its local maximum genus (Q1594860) (← links)
- An inductive definition of cubic toroidal maps (Q1613370) (← links)
- Finite commutative rings whose unitary Cayley graphs have positive genus (Q1657983) (← links)
- Finding non-orientable surfaces in 3-manifolds (Q1688857) (← links)
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs (Q1767627) (← links)
- A note on directed genera of some tournaments (Q1782023) (← links)
- Face covers and the genus problem for apex graphs (Q1850536) (← links)
- Embedding digraphs on orientable surfaces (Q1850600) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- The genus of a random graph (Q1896342) (← links)
- Stratified graphs for imbedding systems (Q1897429) (← links)
- A survey on genus of selected graphs from commutative rings (Q2089481) (← links)
- Minimal quadrangulations of surfaces (Q2171020) (← links)
- Genus polynomials of ladder-like sequences of graphs (Q2196486) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- Finite groups whose noncyclic graphs have positive genus (Q2221044) (← links)
- The genus of complete 3-uniform hypergraphs (Q2284743) (← links)
- On embeddings of circulant graphs (Q2346467) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- On the minimum load coloring problem (Q2466019) (← links)
- The genus distributions of directed antiladders in orientable surfaces (Q2469706) (← links)
- The genus distributions for a certain type of permutation graphs in orientable surfaces (Q2475335) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Genera of Cayley maps (Q2515315) (← links)
- On the number of genus embeddings of complete bipartite graphs (Q2637736) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- (Q2702745) (← links)