Densely embedded graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4173910 (Why is no real title available?)
- scientific article; zbMATH DE number 3910412 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 4049688 (Why is no real title available?)
- scientific article; zbMATH DE number 475597 (Why is no real title available?)
- scientific article; zbMATH DE number 3379174 (Why is no real title available?)
- Clean triangulations
- Computing the orientable genus of projective graphs
- Embeddings of graphs with no short noncontractible cycles
- Genus embeddings for some complete tripartite graphs
- Minimal triangulations on orientable surfaces
- Self-dual embeddings of Cayley graphs
- Self-dual orientable embedding of \(K_n\)
Cited in
(14)- Weighted graphs permitting no LEW-embeddings
- Flexibility of polyhedral embeddings of graphs in surfaces
- Trading crossings for handles and crosscaps
- Combinatorial Local Planarity and the Width of Graph Embeddings
- A simple construction of high representativity triangulations
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- On the uniqueness of kernels
- Embeddings of graphs
- Uniqueness and minimality of large face-width embeddings of graphs
- Planar graphs on the projective plane
- Strong embeddings of minimum genus
- Generating locally-cyclic triangulations of surfaces
- scientific article; zbMATH DE number 1359497 (Why is no real title available?)
- Face-width of embedded graphs
This page was built for publication: Densely embedded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908930)