✦ LIBER ✦

Combinatorial invariants on planar graphs

✍ Scribed by Yanpei Liu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1995
Tongue: English
Weight: 490 KB
Volume: 11
Category: Article
ISSN: 1439-7617
DOI: 10.1007/bf02274063

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial curvature for planar graph

Combinatorial curvature for planar graphs

✍ Yusuke Higuchi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Regarding an infinite planar graph __G__ as a discrete analogue of a noncompact simply connected Riemannian surface, we introduce the combinatorial curvature of __G__ corresponding to the sectional curvature of a manifold. We show this curvature has the property that its negative values

A new approach to solving three combinat

A new approach to solving three combinatorial enumeration problems on planar graphs

✍ Charles J. Colbourn; J.Scott Provan; Dirk Vertigan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 719 KB

On planar hypohamiltonian graphs

✍ Gábor Wiener; Makoto Araya 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for eve

On generating planar graphs

✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 699 KB

A 3-valent graph G 1s cyclically n-connected provided one must cut at least n edges in ori4r to separate any two circuits of 6. If G is cyclically n-connected but any separation of G by cutting n edges yields a component consisting of a simple circuit, then we say that G is ' strong& cyclicaZZy n-co

Combinatorial games on a graph

✍ Claude Berge 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Survey of various problems about combinatorial games. ## O. Introduction A combinatorial game is the situation where two players, usually called A and B, play alternately by selecting an element in a finite set X according to fixed rules; the first player to achieve a certain configuration has wo

On paths in planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy.