Bi-eulerian embeddings of graphs and digraphs
From MaRDI portal
bi-Euleriancircuit decompositiondirected embeddingEulerianmaximum genusorientable graph embeddingrelative embedding
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)
Cites work
- \(A\)-trails of embedded graphs and twisted duals
- A Characterization in of Upper-Embeddable Graphs
- A new characterization of the maximum genus of a graph
- A note on the directed genus of \(K_{n,n,n}\) and \(K_n\)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constructing all minimum genus embeddings of
- Digraphs
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem
- Embedding digraphs on orientable surfaces
- Eulerian graphs and related topics. Part 1, Volume 1
- Generalized Embedding Schemes
- Graphs on surfaces
- Graphs on surfaces. Dualities, polynomials, and knots
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 4177080 (Why is no real title available?)
- scientific article; zbMATH DE number 3650593 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 9847 (Why is no real title available?)
- scientific article; zbMATH DE number 3463663 (Why is no real title available?)
- scientific article; zbMATH DE number 3482371 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- Matroid matching via mixed skew-symmetric matrices
- MAXIMUM GENUS EMBEDDINGS OF LATIN SQUARES
- Maximum genus embeddings of Steiner triple systems
- Maximum genus orientable embeddings from circuit decompositions of dense Eulerian graphs and digraphs (extended abstract)
- New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs
- On existence of reporter strands in DNA-based graph structures
- On the surface duality of linear graphs
- On the upper embedding of Steiner triple systems and Latin squares
- On the upper embedding of symmetric configurations with block size 3
- Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
- Parity systems and the delta-matroid intersection problem
- Relative Embeddings of Graphs on Closed Surfaces
- Straight-ahead walks in Eulerian graphs
- Strong traces model of self-assembly polypeptide structures
- The combinatorial map color theorem
- The linear delta-matroid parity problem
- The nonorientable genus of complete tripartite graphs
- The relative maximum genus of a graph
- Topological extensions of the Tutte polynomial
- Topological graph theory.
- Transforming eulerian trails
This page was built for publication: Bi-eulerian embeddings of graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945767)