✦ LIBER ✦

Irregularity strength of regular graphs of large degree

✍ Scribed by D. Amar

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 437 KB
Volume: 114
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90351-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irregularity strength of dense graphs

✍ Bill Cuckler; Felix Lazebnik 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

## Abstract Let __G__ be a simple graph of order __n__ with no isolated vertices and no isolated edges. For a positive integer __w__, an assignment __f__ on __G__ is a function __f__: __E__(__G__) → {1, 2,…, __w__}. For a vertex __v__, __f__(__v__) is defined as the sum __f__(__e__) over all edges

Irregularity strength of dense graphs

✍ R.J. Faudree; M.S. Jacobson; L. Kinch; J. Lehel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 832 KB

Factorizations of regular graphs of high

Factorizations of regular graphs of high degree

✍ A. J. W. Hilton 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,

Regular 4-critical graphs of even degree

✍ Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

## Abstract In 1960, Dirac posed the conjecture that __r__‐connected 4‐critical graphs exist for every __r__ ≥ 3. In 1989, Erdős conjectured that for every __r__ ≥ 3 there exist __r__‐regular 4‐critical graphs. In this paper, a technique of constructing __r__‐regular __r__‐connected vertex‐transiti

Quotients of connected regular graphs of

Quotients of connected regular graphs of even degree

✍ Jozef Širáň; Martin Škoviera 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 669 KB

Generating all planer graphs regular of

Generating all planer graphs regular of degree four

✍ Paolo Manca 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

## Abstract All planar connected graphs regular of degree four can be generated from the graph of the octahedron, using four operations.