The Reduced Genus of a Multigraph

نویسنده

  • Patrice Ossona de Mendez
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus

In this paper, we give the first polynomial-time algorithm for determining the edge expansion for a graph of fixed orientable genus. We show that for a multigraph G with m edges and orientable genus g, the edge expansion of G can be determined in time m. We show that the same is true for various other similar measures of edge connectivity.

متن کامل

Tutte's 5-flow conjecture for graphs of nonorientable genus 5

We develop four constructions for nowhere-zero 5-ows of 3-regular graphs which satisfy special structural conditions. Using these constructions we show a minimal counterexample to Tutte's 5-ow conjecture is of order 44 and therefore every bridgeless graph of nonorientable genus 5 has a nowhere-zero 5-ow. One of the structural properties is formulated in terms of the structure of the multigraph ...

متن کامل

Least conflict choosability

Given a multigraph, suppose that each vertex is given a local assignment of k colours to its incident edges. We are interested in whether there is a choice of one local colour per vertex such that no edge has both of its local colours chosen. The least k for which this is always possible given any set of local assignments we call the conflict choosability of the graph. This parameter is closely...

متن کامل

Cubic Graphs and Related Triangulations on Orientable Surfaces

Let Sg be the orientable surface of genus g for a fixed non-negative integer g. We show that the number of vertex-labelled cubic multigraphs embeddable on Sg with 2n vertices is asymptotically cgn 5/2(g−1)−1γ2n(2n)!, where γ is an algebraic constant and cg is a constant depending only on the genus g. We also derive an analogous result for simple cubic graphs and weighted cubic multigraphs. Addi...

متن کامل

Regular maps with simple underlying graphs

A regular map is a symmetric embedding of a graph (or multigraph) on some closed surface. In this paper we consider the genus spectrum for such maps on orientable surfaces, with simple underlying graph. It is known that for some positive integers g, there is no orientably-regular map of genus g for which both the map and its dual have simple underlying graph, and also that for some g, there is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999