Flexibility of polyhedral embeddings of graphs in surfaces
From MaRDI portal
Publication:1850555
DOI10.1006/jctb.2001.2036zbMath1024.05023OpenAlexW2120446949MaRDI QIDQ1850555
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2001.2036
Related Items (7)
Flexibility of projective-planar embeddings ⋮ Rigidity and separation indices of graphs in surfaces ⋮ From Invariants to Canonization in Parallel ⋮ Algorithms for the edge-width of an embedded graph ⋮ On the flexibility of toroidal embeddings ⋮ Generating polyhedral quadrangulations of the projective plane ⋮ Panel structures of triangulations on the torus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Densely embedded graphs
- Embeddings of graphs with no short noncontractible cycles
- Surface triangulations with isometric boundary
- Exponential families of non-isomorphic triangulations of complete graphs
- Uniqueness and minimality of large face-width embeddings of graphs
- Systems of curves on surfaces
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
This page was built for publication: Flexibility of polyhedral embeddings of graphs in surfaces