✦ LIBER ✦

On strongly almost trivial embeddings of graphs

✍ Scribed by Ryo Hanaki

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 181 KB
Volume: 70
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20601

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We present four new classes of graphs, two of which every member has a strongly almost trivial embedding, and the other two of which every member has no strongly almost trivial embeddings. We show that the property that a graph has a strongly almost trivial embedding and the property that a graph has no strongly almost trivial embeddings are not inherited by minors. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory

📜 SIMILAR VOLUMES

Planar graphs producing no strongly almo

Planar graphs producing no strongly almost trivial embedding

✍ Youngsik Huh; Seungsang Oh 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract We present here infinitely many planar graphs which have no strongly almost trivial embeddings. Then we conclude that “__strongly almost trivial__” is more strict concept than “__almost trivial.__”. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 319–326, 2003

Embeddings of Un(q2) and symmetric stron

Embeddings of Un(q2) and symmetric strongly regular graphs

✍ Antonio Cossidente 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract In the geometric setting of the embedding of the unitary group __U__~__n__~(__q__^2^) inside an orthogonal or a symplectic group over the subfield __GF__(__q__) of __GF__(__q__^2^), __q__ odd, we show the existence of infinite families of transitive two‐character sets with respect to hy

On Scale Embeddings of Graphs into Hyper

On Scale Embeddings of Graphs into Hypercubes

✍ S.V. Shpectorov 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 492 KB

On embeddings of graphs containing noK5-

On embeddings of graphs containing noK5-minor

✍ Zhang, Cun-Quan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 2 views

In this paper, w e proved that every 2-connected graph containing no &-minor has a closed 2-cell embedding on some 2-manifold surface.

On convex embeddings of planar 3-connect

On convex embeddings of planar 3-connected graphs

✍ Kelmans, Alexander 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 2 views

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in thi

A Note on Almost Regular Graphs

✍ M. Of Hofmeister Munich 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.