scientific article; zbMATH DE number 951476
From MaRDI portal
Publication:4716822
Recommendations
Cited in
(61)- On the embedding genus distribution of ladders and crosses
- Genus distribution of ladder type and cross type graphs
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- A characterization of embeddability of graphs on surfaces
- The maximum genus of graphs with diameter three
- Extensions on 2-edge connected 3-regular up-embeddable graphs
- Embeddings of graphs
- Enumeration of graph embeddings
- 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
- Maximum genus of strong embeddings
- A note on the maximum genus of 3-edge-connected nonsimple graphs
- A relative maximum genus graph embedding and its local maximum genus
- Boolean approaches to graph embeddings related to VLSI
- Length bounds for cycle bases of graphs
- Proceedings of the conference ``Embedded graphs
- A note on directed genera of some tournaments
- Counting rooted near-4-regular Eulerian maps on some surfaces
- The maximum genus of a 3-regular simplicial graph
- An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
- Singular maps on the Klein bottle
- 4-regular maps on the Klein bottle
- A tight lower bound on the maximum genus of 3-edge connected loopless graphs
- Chromatic sums of singular maps on some surfaces.
- Generating cycle spaces for graphs on surfaces with small genera
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Embedding graphs into embedded graphs
- Embedding of elementary net into gap of nets
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
- On the average crosscap number. II: Bounds for a graph
- Up-embeddability of a graph by order and girth
- Orientable embedding genus distribution for certain types of graphs
- Results of the maximum genus of graphs
- The genus distributions for a certain type of permutation graphs in orientable surfaces
- The semi-arc automorphism group of a graph with application to map enumeration
- Structure for a graph with average genus
- Weak embedding of planar graphs
- The total embedding distributions of cacti and necklaces
- On the number of genus embeddings of complete bipartite graphs
- An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
- The genus of the balanced hypercube
- Bounded complete embedding graphs
- scientific article; zbMATH DE number 6484457 (Why is no real title available?)
- Embedding into Bipartite Graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Minimum genus embeddings of the complete graph
- scientific article; zbMATH DE number 4139769 (Why is no real title available?)
- scientific article; zbMATH DE number 4164896 (Why is no real title available?)
- Embedding Graphs into Embedded Graphs
- Up-embeddability of graphs with new degree-sum
- A note on strong embeddings of maximal planar graphs on non-orientable surfaces
- Surface embeddability of graphs via homology
- Up-embeddability of graphs with small order
- Strong embedding of HP-graphs on surface with higher genus
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- Genus embeddings of a type of graph
- On embeddability and stresses of graphs
- The genus of a type of graph
- On the lower bounds for the maximum genus for simple graphs
- Number of embeddings of circular and Möbius ladders on surfaces
- On the decomposition of graphs into complete bipartite graphs
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 Q4716822)
