𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On some properties of 4-regular plane graphs

✍ Scribed by Mirko Horňá; Stanislav Jendroľ

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
542 KB
Volume
20
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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‐regular plane graphs. We show that 0‐distance face chromatic number of any connected multi‐3‐gonal 4‐regular plane graphs is 4. © 1995, John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Vertex signatures and edge-4-colorings o
Vertex signatures and edge-4-colorings of 4-regular plane graphs
✍ François Jaeger; Gerhard Koester 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 1 views

## Abstract We associate partitions of the edge‐set of a 4‐regular plane graph into 1‐factors or 2‐factors to certain 3‐valued vertex signatures in the spirit of the work by H. Grötzsch [1]. As a corollary we obtain a simple proof of a result of F. Jaeger and H. Shank [2] on the edge‐4‐colorability

The linear arboricity of some regular gr
The linear arboricity of some regular graphs
✍ Hikoe Enomoto; Bernard Péroche 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB

W e prove that the linear arboricity of every 5-regular graph is 3. That is, the edges of any 5-regular graph are covered by three linear forests. W e also determine the linear arboricity of 6-regular graphs and 8-regular graphs. These results improve the known upper bounds for the linear arboricity

Number of labeled 4-regular graphs
Number of labeled 4-regular graphs
✍ R. C. Read; N. C. Wormald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

## Abstract Several operations on 4‐regular graphs and pseudographs are analyzed and equations are obtained relating the numbers of these graphs on given numbers of labeled points. These equations are used recursively to find the numbers of 4‐regular graphs on up to 13 labeled points.

Some Formulas for Spin Models on Distanc
Some Formulas for Spin Models on Distance-Regular Graphs
✍ Brian Curtin; Kazumasa Nomura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A spin model is a square matrix W satisfying certain conditions which ensure that it yields an invariant of knots and links via a statistical mechanical construction of V. F. R. Jones. Recently F. Jaeger gave a topological construction for each spin model W of an association scheme which contains W

On some Graphs Related to Regular, Orien
On some Graphs Related to Regular, Oriented Triangular Maps
✍ M.L.N. Downs 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 328 KB

We examine the graph ( G , ) , where the vertices are given by the elements of the conjugacy class of the finite group G , and then adjacency ( ϳ ) given by ϳ u ï both u 2 and u 2 are involutions and u ϶ . In particular , under certain conditions on the pair ( G , ) we may derive from ( G , ) a sec