✦ LIBER ✦

A reduction criterion for supereulerian graphs

✍ Scribed by Catlin, Paul A.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 162 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199606)22:2<151::aid-jgt5>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a graph, and let H be a connected subgraph of G. When it is known that the graph G/H (obtained from G by contracting H to a vertex) has a spanning eulerian subgraph, under what conditions can it be inferred that G itself has a spanning eulerian subgraph? 0 1996 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Isomorphism criterion for monomial graph

Isomorphism criterion for monomial graphs

✍ Vasyl Dmytrenko; Felix Lazebnik; Raymond Viglione 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __q__ be a prime power, 𝔽~__q__~ be the field of __q__ elements, and __k__, __m__ be positive integers. A bipartite graph __G__ = __G~q~__(__k__, __m__) is defined as follows. The vertex set of __G__ is a union of two copies __P__ and __L__ of two‐dimensional vector spaces over 𝔽~__

A criterion for the planarity of a graph

✍ Jerome R. Breitenbach 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi

A new planarity criterion for 3-connecte

A new planarity criterion for 3-connected graphs

✍ Alexander K. Kelmans 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB 👁 1 views

## Abstract Direct proofs of some planarity criteria are presented.

A short proof of Kuratowski's graph plan

A short proof of Kuratowski's graph planarity criterion

✍ Makarychev, Yury 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

We present a new short combinatorial proof of the sufficiency part of the well-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain θ-subgraph; (2) G-x-y is homeomorphic to the circle; (3)

A Criterion for Starlikeness

✍ Milutin Obradović; Shigeyoshi Owa 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB

Abstraet. Let f(z) =z+%zZ+ ... be analytic in the unit disc U = ( z : IzI -=l). By use of certain , zE U, end the method of differential subordinations, we give a criterion for a function f ( z ) to be in a certain class S\*[a, b] of starlike functions.

On the delta-wye reduction for planar gr

On the delta-wye reduction for planar graphs

✍ K. Truemper 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We provide an elementary proof of an important theorem by G. V. Epifanov, according to which every two-terminal planar graph satisfying certain connectivity restrictions can by some sequence of series/parallel reductions and delta-wye exchanges be reduced to the graph consisting of the two terminals