On the relations between arboricity and independent number or covering number

✍ Scribed by Zhang Zhongfu; Liu Linzhong; Zhang Jianxun; Wang Jianfang

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 307 KB
• Volume: 87
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(98)00062-6

✦ Synopsis

In this paper, the following results are obtained:

and all bounds are sharp, where p= IV(G)/, [xl denotes the smallest integer greater than or equal to x, a(G) is the vertex arboricity, a'(G) is the edge arboricity, r'(G) is the edge covering number, p(G) is the vertex independent number, j?'(G) is the edge independent number, and 6 is the minimum degree of G.