𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound for the Dilworth number

✍ Scribed by C. van Nuffelen; M. van Wouwe

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
370 KB
Volume
81
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We give upper bounds for the Dilworth number of a graph. These bounds are formulated in terms of the rank of the adjacency matrix (vertex-vertex matrix) of the graph.

πŸ“œ SIMILAR VOLUMES

A polynomial bound for the lap number
A polynomial bound for the lap number
✍ Mathieu Baillif πŸ“‚ Article πŸ“… 2002 πŸ› SP BirkhΓ€user Verlag Basel 🌐 English βš– 108 KB
A new upper bound for the harmonious chr
A new upper bound for the harmonious chromatic number
✍ Edwards, Keith πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 200 KB πŸ‘ 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general

A bound for the game chromatic number of
A bound for the game chromatic number of graphs
✍ Thomas Dinski; Xuding Zhu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula