✦ LIBER ✦

On a Problem Concerningk-Subdomination Numbers of Graphs

✍ Scribed by Bohdan Zelinka

Book ID: 111577345
Publisher: Springer
Year: 2003
Tongue: English
Weight: 86 KB
Volume: 53
Category: Article
ISSN: 0011-4642
DOI: 10.1023/b:cmaj.0000024508.43606.9a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture concerningk-Hamilton-nic

On a conjecture concerningk-Hamilton-nice sequences

✍ Yiping Liu; Zhengsheng Wu 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 363 KB

On an extremal problem concerning the in

On an extremal problem concerning the interval number of a graph

✍ Thomas Andreae 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 504 KB

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

Linear algorithm for domatic number prob

Linear algorithm for domatic number problem on interval graphs

✍ A.Srinavasa Rao; C.Pandu Rangan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 629 KB

The domatic number problem on some perfe

The domatic number problem on some perfect graph families

✍ Haim Kaplan; Ron Shamir 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 543 KB

A note on the bichromatic numbers of gra

A note on the bichromatic numbers of graphs

✍ Dennis D. A. Epple; Jing Huang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views