𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the maximum average degree and the oriented chromatic number of a graph

✍ Scribed by O.V. Borodin; A.V. Kostochka; J. Nešetřil; A. Raspaud; E. Sopena

Book ID
108316322
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
129 KB
Volume
206
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The total chromatic number of graphs hav
The total chromatic number of graphs having large maximum degree
✍ A.J.W. Hilton; H.R. Hind 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 935 KB

Hilton, A.J.W. and H.R. Hind, The total chromatic number ofgraphs having large maximum degree, Discrete Mathematics 117 (1993) 127-140. The total colouring conjecture is shown to be correct for those graphs G having d(G)>21 V(G)I.

A note on the total chromatic number of
A note on the total chromatic number of Halin graphs with maximum degree 4
✍ Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

In this paper, we prove that XT(G) = 5 for any Halin graph G with A(G) = 4, where A(G) and XT(G) denote the maximal degree and the total chromatic number of G, respectively.

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

The average degree of an edge-chromatic
The average degree of an edge-chromatic critical graph II
✍ Douglas R. Woodall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract A graph __G__ with maximum degree Δ and edge chromatic number $\chi\prime({G}) > \Delta$ is __edge__‐Δ‐__critical__ if $\chi\prime{(G-e)} = \Delta$ for every edge __e__ of __G__. It is proved that the average degree of an edge‐Δ‐critical graph is at least ${2\over 3}{(\Delta+1)}$ if $\D