𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Note on vertex degrees of planar graphs

✍ Scribed by Miroslaw Truszczyáski

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
202 KB
Volume
8
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on vertex pancyclic oriented grap
A note on vertex pancyclic oriented graphs
✍ Bang-Jensen, J�rgen; Guo, Yubao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

Let D be an oriented graph of order n ≥ 9, minimum degree at least n -2, such that, for the choice of distinct vertices x and y, . Graph Theory 18 (1994), 461-468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also

On the linear vertex-arboricity of a pla
On the linear vertex-arboricity of a planar graph
✍ K. S. Poh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 1 views

## Abstract We prove in this note that the linear vertex‐arboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.

M-degrees of quadrangle-free planar grap
M-degrees of quadrangle-free planar graphs
✍ Oleg V. Borodin; Alexandr V. Kostochka; Naeem N. Sheikh; Gexin Yu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract The __M‐degree__ of an edge __xy__ in a graph is the maximum of the degrees of __x__ and __y__. The __M‐degree__ of a graph __G__ is the minimum over __M__‐degrees of its edges. In order to get upper bounds on the game chromatic number, He et al showed that every planar graph __G__ with

On the vertex face total chromatic numbe
On the vertex face total chromatic number of planar graphs
✍ Weifan, Wang; Jiazhuang, Liu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 471 KB 👁 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for