✦ LIBER ✦

On the Euler genus of a 2-connected graph

✍ Scribed by R.Bruce Richter

Book ID: 107884254
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 475 KB
Volume: 43
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90030-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the non-orientable genus of a 2-conne

On the non-orientable genus of a 2-connected graph

✍ R.Bruce Richter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 589 KB

The Maximum Genus on a 3-Vertex-Connecte

The Maximum Genus on a 3-Vertex-Connected Graph

✍ Yuangqiu Huang 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 104 KB

On the genus and connectivity of Hamilto

On the genus and connectivity of Hamiltonian graphs

✍ Richard A. Duke 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 675 KB

On the algebraic connectivity of graphs

On the algebraic connectivity of graphs as a function of genus

✍ Jason J. Molitierno 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing that for fixed k 1, the graph of genus k of largest algebraic connectivity is a complete graph. We then find an upper bound for noncomplete graphs of a fixed genus k 1 and we determine the values of

The codiameter of a 2-connected graph

✍ Pei Wang; Xuezheng Lv 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 193 KB

On the eulericity of a graph

✍ K. R. Matthews 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract The eulericity ϵ(__G__) of a bridgeless graph __G__ is defined as the least number of eulerian subgraphs of __G__ which together cover the lines of __G__. A 1–1 correspondence is shown to exist between the __k__‐tuples of eulerian subgraphs of __G__ and the proper flows (mod2^__k__^) on