Tight and untight triangulations of surfaces by complete graphs

DOI10.1006/jctb.1995.1015zbMath0832.05035OpenAlexW1978553161MaRDI QIDQ1892842

Jorge Luis Arocha, Víctor Neumann-Lara, Javier Bracho

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1015

zbMATH Keywords

connectednesstightnesssurfacescomplete graphclosed surfacecoupling constructiontriangular embeddingscomplete triangular surfaces

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (13)

Null and non-rainbow colorings of projective plane and sphere triangulations ⋮ Looseness width of 5-connected triangulations on the torus ⋮ Embeddings of a graph into a surface with different weak chromatic numbers ⋮ Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs ⋮ Carathéodory-type theorems à la Bárány ⋮ Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness ⋮ Non-rainbow colorings of 3-, 4- and 5-connected plane graphs ⋮ Looseness and independence number of triangulations on closed surfaces ⋮ Circulant tournaments of prime order are tight ⋮ Proper colorings of plane quadrangulations without rainbow faces ⋮ Tightness problems in the plane ⋮ Diagonal flips in triangulations on closed surfaces with minimum degree at least 4 ⋮ Looseness ranges of triangulations on closed surfaces

This page was built for publication: Tight and untight triangulations of surfaces by complete graphs