Looseness and Independence Number of Triangulations on Closed Surfaces

Open access

Abstract

The looseness of a triangulation G on a closed surface F2, denoted by ξ (G), is defined as the minimum number k such that for any surjection c : V (G) → {1, 2, . . . , k + 3}, there is a face uvw of G with c(u), c(v) and c(w) all distinct. We shall bound ξ (G) for triangulations G on closed surfaces by the independence number of G denoted by α(G). In particular, for a triangulation G on the sphere, we have

and this bound is sharp. For a triangulation G on a non-spherical surface F2, we have

ξ (G) ≤ 2α(G) + l(F2) − 2,

where l(F2) = [(2 − χ(F2))/2] with Euler characteristic χ(F2).

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] K. Appel W. Haken and J. Koch Every planar map is four colorable Illinois J. Math. 21 (1977) 429-567.

  • [2] J.L. Arocha J. Bracho and V. Neumann-Lara On the minimum size of tight hypergraphs J. Graph Theory 16 (1992) 319-326. doi:10.1002/jgt.3190160405

  • [3] J.L. Arocha J. Bracho and V. Neumann-Lara Tight and untight triangulations surfaces by complete graphs J. Combin. Theory Ser. B 63 (1995) 185-199. doi:10.1006/jctb.1995.1015

  • [4] J. Czap S. Jendroľ F. Kardoš and J. Miškuf Looseness of plane graphs Graphs Combin. 27 (2011) 73-85. doi:10.1007/s00373-010-0961-6

  • [5] S. Negami and T. Midorikawa Loosely-tightness of triangulations of closed surfaces Sci. Rep. Yokohama Nat. Univ. Sec. I 43 (1996) 25-41.

  • [6] S. Negami Looseness ranges of traingulations on closed surfaces Discrete Math. 303 (2005) 167-174. doi:10.1016/j.disc.2005.01.010

  • [7] G. Ringel Map Color Theorem (Springer-Verlag Berlin Heidelberg 1974). doi:10.1007/978-3-642-65759-7

  • [8] T. Tanuma One-loosely tight triangulations on closed surfaces Yokohama Math. J. 47 (1999) 203-211.

Search
Journal information
Impact Factor

IMPACT FACTOR 2018: 0.741
5-year IMPACT FACTOR: 0.611

CiteScore 2018: 0.73

SCImago Journal Rank (SJR) 2018: 0.763
Source Normalized Impact per Paper (SNIP) 2018: 0.934

Mathematical Citation Quotient (MCQ) 2018: 0.42

Target audience:

researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs

Metrics
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 205 126 1
PDF Downloads 89 58 2