scientific article; zbMATH DE number 951476
From MaRDI portal
Publication:4716822
zbMath0863.05027MaRDI QIDQ4716822
Publication date: 28 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planarityembeddabilityVLSI designscrossing problemmatroid problemplanarity testing problempolyhedra isomorphism problemWu-Tutte theorem
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (48)
Chromatic sums of singular maps on some surfaces. ⋮ Length bounds for cycle bases of graphs ⋮ Generating cycle spaces for graphs on surfaces with small genera ⋮ On the average crosscap number. II: Bounds for a graph ⋮ Up-embeddability of graphs with small order ⋮ On the number of genus embeddings of complete bipartite graphs ⋮ Minimum genus embeddings of the complete graph ⋮ Unnamed Item ⋮ Maximum genus and maximum nonseparating independent set of a 3-regular graph ⋮ A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid ⋮ Strong embedding of HP-graphs on surface with higher genus ⋮ A characterization of embeddability of graphs on surfaces ⋮ Surface embeddability of graphs via homology ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Maximum genus of strong embeddings ⋮ The genus polynomials of cross-ladder digraphs in orientable surfaces ⋮ Up-embeddability of a graph by order and girth ⋮ Orientable embedding genus distribution for certain types of graphs ⋮ Genus embeddings of a type of graph ⋮ Results of the maximum genus of graphs ⋮ The genus distributions for a certain type of permutation graphs in orientable surfaces ⋮ Up-embeddability of graphs with new degree-sum ⋮ The genus of a type of graph ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ A note on strong embeddings of maximal planar graphs on non-orientable surfaces ⋮ The semi-arc automorphism group of a graph with application to map enumeration ⋮ A note on directed genera of some tournaments ⋮ Number of embeddings of circular and Möbius ladders on surfaces ⋮ Structure for a graph with average genus ⋮ Weak embedding of planar graphs ⋮ The total embedding distributions of cacti and necklaces ⋮ On the decomposition of graphs into complete bipartite graphs ⋮ The genus of the balanced hypercube ⋮ Counting rooted near-4-regular Eulerian maps on some surfaces ⋮ The maximum genus of a 3-regular simplicial graph ⋮ On the embedding genus distribution of ladders and crosses ⋮ An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid ⋮ Genus distribution of ladder type and cross type graphs ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices ⋮ The maximum genus of graphs with diameter three ⋮ Extensions on 2-edge connected 3-regular up-embeddable graphs ⋮ Singular maps on the Klein bottle ⋮ A note on the maximum genus of 3-edge-connected nonsimple graphs ⋮ 4-regular maps on the Klein bottle ⋮ A relative maximum genus graph embedding and its local maximum genus ⋮ A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs ⋮ Boolean approaches to graph embeddings related to VLSI ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
This page was built for publication:
