Regular embeddings of multigraphs

نویسندگان

  • Hubert De Fraysseix
  • Patrice Ossona de Mendez
چکیده

We prove that the vertex set of any twin-free loopless multigraph G has an embedding into some point set P of some Euclidean space R , such that the automorphism group of G is isomorphic to the isometry group of R globally preserving P .

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

ثبت نام

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

منابع مشابه

Regular Embeddings of Multigraphs Hubert De Fraysseix and Patrice Ossona De Mendez

We prove that the vertex set of any twin-free loopless multigraph G has an embedding into some point set P of some Euclidean space R , such that the automorphism group of G is isomorphic to the isometry group of R globally preserving P .

متن کامل

Regular Multigraphs of High Degree Are 1-factorizable

Chetwynd and Hilton showed that any regular simple graph with even order n and maximum degree at least \n has chromatic index equal to its maximum degree. We show how to extend this result to general multigraphs, including those of odd order. This also verifies a special case of conjectures by Goldberg and Seymour.

متن کامل

Quartic Graphs with Every Edge in a Triangle

We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from the line multigraphs of cubic multigraphs by a number of simple subgraph-replacement operations. A corollary of this is that a simple quartic graph with every e...

متن کامل

Irregular embeddings of multigraphs with fixed chromatic number

Let G be a c-chromatic multigraph (c >t 2) with maximum edge multiplicity s. In this note we show that G has an embedding as an induced subgraph, into some degree irregular c-chromatic multigraph having the same maximum edge multiplicity.

متن کامل

Multilingual Word Embeddings using Multigraphs

We present a family of neural-network– inspired models for computing continuous word representations, specifically designed to exploit both monolingual and multilingual text. This framework allows us to perform unsupervised training of embeddings that exhibit higher accuracy on syntactic and semantic compositionality, as well as multilingual semantic similarity, compared to previous models trai...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2017