𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Greedy Construction of Nearly Regular Graphs

✍ Scribed by G.O.H. Katona; Á. Seress

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
560 KB
Volume
14
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On nearly regular co-critical graphs
On nearly regular co-critical graphs
✍ Tibor Szabó 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A graph G is called (K 3, K3)-co-critical if the edges of G can be coloured with two colours without getting a monochromatic triangle, but adding any new edge to the graph, this kind of 'good' colouring is impossible. In this short note we construct (K 3, K3)-co-critical graphs of maximal degree O(n

Constructing Infinite One-regular Graphs
Constructing Infinite One-regular Graphs
✍ Aleksander Malnič; Dragan Marušič; Norbert Seifter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 134 KB

A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

Fast generation of regular graphs and co
Fast generation of regular graphs and construction of cages
✍ Meringer, Markus 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly genera

Regular factors of regular graphs
Regular factors of regular graphs
✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a