✦ LIBER ✦

On a problem of a. kotzig concerning factorizations of 4-regular graphs

✍ Scribed by Bohdan Zelinka

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 247 KB
Volume: 8
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190080212

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 ,

A Family of One-regular Graphs of Valenc

A Family of One-regular Graphs of Valency 4

✍ Dragan Marusic 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 246 KB

A Note on Almost Regular Graphs

✍ M. Of Hofmeister Munich 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.

A generalization of the Oberwolfach prob

A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs

✍ Jiuqiang Liu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 1 views

On a Problem of Schweiger Concerning Nor

On a Problem of Schweiger Concerning Normal Numbers

✍ Cor Kraaikamp; Hitoshi Nakada 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Let T and S be two number theoretical transformations on the n-dimensional unit cube B, and write TtS if there exist positive integers m and n such that T m =S n . F. Schweiger showed in [1969, J. Number Theory 1, 390 397] that TtS implies that every T-normal number x is S-normal. Furthermore, he co

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