๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graceful valuations of 2-regular graphs with two components

โœ Scribed by Jaromir Abrham; Anton Kotzig

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
714 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

All 2-regular graphs consisting of 4-cyc
All 2-regular graphs consisting of 4-cycles are graceful
โœ Jaromir Abrham; Anton Kotzig ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 871 KB

It is shown that the graph kc, (consisting of k 4-cycles) has an a-valuation (a stronger form of the graceful valuation) for every positive integer k # 3. The graph 3C, is known to be graceful but it does not have an a-valuation.

Valuation ideals of order two in 2-dimen
Valuation ideals of order two in 2-dimensional regular local rings
โœ Sunsook Noh ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 233 KB

## Abstract Let __K__ be the quotient field of a 2โ€dimensional regular local ring (__R, m__) and let __v__ be a prime divisor of __R__, i.e., a valuation of __K__ birationally dominating __R__ which is residually transcendental over __R__. Zariski showed that: such prime divisor __v__ is uniquely a

Regular planar graphs with faces of only
Regular planar graphs with faces of only two types and shortness parameters
โœ P. J. Owens ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 931 KB

We construct a small non-Hamiltonian 3-connected trivalent planar graph whose faces are all 4-gons or 7-gons and show that the shortness coefficient of the class of such graphs is less than one. Then, by transforming non-Hamiltonian trivalent graphs into regular graphs of valency four or five, we ob

A 2-factor with two components of a grap
A 2-factor with two components of a graph satisfying the Chvรกtal-Erdรถs condition
โœ Atsushi Kaneko; Kiyoshi Yoshimoto ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB ๐Ÿ‘ 1 views

## Abstract Chvรกtal and Erdรถs showed that a __k__โ€connected graph with independence number at most __k__ and order at least three is hamiltonian. In this paper, we show that a graph contains a 2โ€factor with two components, i.e., the graph can be divided into two cycles if the graph is __k__(โ‰ฅ 4)โ€co

5-regular 3-polytopal graphs with edges
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one
โœ J. Harant; P.J. Owens; M. Tkรกฤ; H. Walther ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 309 KB

It is shown that, if q >/29 and q ~ 0 (mod 3), the infinite class of 5-regular 3-polytopal graphs whose edges are incident with either two triangles or a triangle and a q-gon contains nonhamiltonian members and even has shortness exponent less than one.