✦ LIBER ✦

A note on the exceptional graph of the cubic lattice graph characterization

✍ Scribed by Curtis R Cook

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 253 KB
Volume: 14
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90056-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the f-factor-lattice of bipart

A note on the f-factor-lattice of bipartite graphs

✍ J Rieder 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 406 KB

A note on the characterization of domina

A note on the characterization of domination perfect graphs

✍ Jason Fulman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, γ(__H__) = __i__(__H__), where γ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of

A note on shortest cycle covers of cubic

A note on shortest cycle covers of cubic graphs

✍ Xinmin Hou; Cun-Quan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_

A Note on the Zeta Function of a Graph

✍ Sam Northshield 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num

A note on the interval number of a graph

✍ Paul Erdös; Douglas B. West 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Three results on the interval number of a graph on n vertices are presented. (1) The interval number of almost every graph is between n/4 Ig n and n/4 (this also holds for almost every bipartite graph). ( 2) There exist K+\_,, -free bipartite graphs with interval number at least c(m)n 1-2'Cm+1J/lg

The 2-matching lattice of a graph

✍ Dieter Jungnickel; Matthias Leclerc 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 135 KB