Looseness and independence number of triangulations on closed surfaces

DOI10.7151/dmgt.1870zbMath1339.05079OpenAlexW2467996220MaRDI QIDQ726633

Seiya Negami, Yusuke Suzuki, Atsuhiro Nakamoto, Kyoji Ohba

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1870

zbMATH Keywords

independence numbertriangulationsclosed surfaceslooseness\(k\)-loosely tight

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Proper colorings of plane quadrangulations without rainbow faces

Cites Work

• Looseness of plane graphs
• Every planar map is four colorable. II: Reducibility
• Tight and untight triangulations of surfaces by complete graphs
• Looseness ranges of triangulations on closed surfaces
• On the minimum size of tight hypergraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Looseness and independence number of triangulations on closed surfaces