𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On existence and regularity of graphs with certain properties

✍ Scribed by Stefan Znám

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
651 KB
Volume
16
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some properties of 4-regular plane gr
On some properties of 4-regular plane graphs
✍ Mirko Horňá; Stanislav Jendroľ 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 542 KB

## Abstract The __d__‐distance face chromatic number of a connected plane graph is the minimum number of colors in such a coloring of its faces that whenever two distinct faces are at the distance at most __d__, they receive distinct colors. We estimate 1‐distance chromatic number for connected 4‐r

A classification of certain graphs with
A classification of certain graphs with minimal imperfection properties
✍ S.H. Whitesides 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 941 KB

IfI,: family of Bar, w) graphs ate of interest for several reasons. For example, any minimal fomenter-example to Rerge's Strong Perfect Graph Conjecture t %ngs to this family. This paper aciounts for ail (4.3) graphs. One of these is not obtainatde by existing techniques for geg~~rati~g (a + I, w) g

One-factorizations of complete graphs wi
One-factorizations of complete graphs with vertex-regular automorphism groups
✍ Arrigo Bonisoli; Domenico Labbate 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun

On the bipartite density of regular grap
On the bipartite density of regular graphs with large girth
✍ Ondřej Zýka 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__‖__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k → ∞~ __b~k~__ ≥ 6/7.

On the existence of countable universal
On the existence of countable universal graphs
✍ F�redi, Zolt�n; Komj�th, P�ter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 2 views

Let Forb(G) denote the class of graphs with countable vertex sets which do not contain G as a subgraph. If G is finite, 2-connected, but not complete, then Forb(G) has no element which contains every other element of Forb(G) as a subgraph, i.e., this class contains no universal graph.