✦ LIBER ✦

On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph

✍ Scribed by Nirmala Achuthan N. R. Achuthan; M. Simanihuruk

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 201 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00510-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nordhaus–Gaddum bounds on the -rainbow d

Nordhaus–Gaddum bounds on the -rainbow domatic number of a graph

✍ D. Meierling; S.M. Sheikholeslami; L. Volkmann 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 212 KB

For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex rainbow dominating family (of functions) on G. The maximum number of functions in a k-rainbow dominating f

On Hadwiger's number— a problem of the N

On Hadwiger's number— a problem of the Nordhaus-Gaddum type

✍ M. Stiebitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Stiebitz, M., On Hadwiger's number-A problem of the Nordhaus-Gaddum type, Discrete Mathematics 101 (1992) 307-317. The Hadwiger number of a graph G = (V, E), denoted by q(G), is the maximum size of a complete graph to which G can be contracted. Let %((n, k):= {G 1 IV(G)1 = n and n(G) = k}. We shall

Extremal graphs for the list-coloring ve

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

✍ Simone Dantas; Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We characterize the graphs G such that Ch(G) + Ch( G) = n + 1, where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices.

Extremal graphs for the list-coloring ve

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

✍ Simone Dantas; Sylvain Gravier; Frederic Maffray; Bojan Mohar 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

On the harmonious chromatic number of a

On the harmonious chromatic number of a graph

✍ John Mitchem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe

A bound on the chromatic number of a gra

A bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.