✦ LIBER ✦

A lower bound on cochromatic number for line graphs of a kind of graphs

✍ Scribed by Liu Xinsheng; Chen Xiang’en; Ou Lifeng

Book ID: 107500578
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2006
Tongue: English
Weight: 186 KB
Volume: 21
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-003-0013-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cochromatic Number and the Genus of a Gr

Cochromatic Number and the Genus of a Graph

✍ H. Joseph Straight 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract The cochromatic number of a graph __G__, denoted by __z__(__G__), is the minimum number of subsets into which the vertex set of __G__ can be partitioned so that each sbuset induces an empty or a complete subgraph of __G__. In this paper we introduce the problem of determining for a surf

A lower bound on the Hamiltonian path co

A lower bound on the Hamiltonian path completion number of a line graph

✍ Detti, Paolo; Meloni, Carlo; Pranzo, Marco 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A lower bound on the independence number

A lower bound on the independence number of a graph

✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A lower bound for the interval number of

A lower bound for the interval number of a graph

✍ Christoph Maas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A Probabilistic lower bound on the indep

A Probabilistic lower bound on the independence number of graphs

✍ Stanley M. Selkow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Caro (1979) and Wei (1981) established a bound on the size of an independent set of a graph as a function of its degrees. In case the degrees of each vertex's neighbors are also known, we establish a lower bound which is tighter for most graphs.