Densely embedded graphs
From MaRDI portal
DOI10.1016/0095-8956(92)90064-5zbMATH Open0694.05024OpenAlexW2007513443MaRDI QIDQ908930FDOQ908930
Authors: Dan S. Archdeacon 
Publication date: 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(92)90064-5
Recommendations
Cites Work
- Title not available (Why is that?)
- Embeddings of graphs with no short noncontractible cycles
- Minimal triangulations on orientable surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genus embeddings for some complete tripartite graphs
- Computing the orientable genus of projective graphs
- Title not available (Why is that?)
- Clean triangulations
- Self-dual orientable embedding of \(K_n\)
- Self-dual embeddings of Cayley graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Strong embeddings of minimum genus
- Embeddings of graphs
- Generating locally-cyclic triangulations of surfaces
- Weighted graphs permitting no LEW-embeddings
- Trading crossings for handles and crosscaps
- Combinatorial Local Planarity and the Width of Graph Embeddings
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Face-width of embedded graphs
- On the uniqueness of kernels
- Title not available (Why is that?)
- A simple construction of high representativity triangulations
- Flexibility of polyhedral embeddings of graphs in surfaces
- Uniqueness and minimality of large face-width embeddings of graphs
- Planar graphs on the projective plane
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)
