(4m, m)-CHOOSABILITY OF PLANE GRAPHS

Bao Gang XU

系统科学与复杂性(英文) ›› 2001, Vol. 14 ›› Issue (2) : 174-178.

PDF(273 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(273 KB)
系统科学与复杂性(英文) ›› 2001, Vol. 14 ›› Issue (2) : 174-178.
论文

(4m, m)-CHOOSABILITY OF PLANE GRAPHS

    Bao Gang XU
作者信息 +

(4m, m)-CHOOSABILITY OF PLANE GRAPHS

    Bao Gang XU
Author information +
文章历史 +

摘要

A graph G is (a, b)-choosable for nonnegative integers a > b if for any given family {A(v)\v ε V(G)} of sets A(v) of cardinality a there exists a family {B(v)\v ε V(G)} of subsets B(v) A(v) of cardinality b such that B(u) B(v) =θ.

Abstract

A graph G is (a, b)-choosable for nonnegative integers a > b if for any given family {A(v)\v ε V(G)} of sets A(v) of cardinality a there exists a family {B(v)\v ε V(G)} of subsets B(v) A(v) of cardinality b such that B(u) B(v) =θ.

关键词

Choosable / plane graph / triangle

Key words

Choosable / plane graph / triangle

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
Bao Gang XU. (4m, m)-CHOOSABILITY OF PLANE GRAPHS. 系统科学与复杂性(英文), 2001, 14(2): 174-178
Bao Gang XU. (4m, m)-CHOOSABILITY OF PLANE GRAPHS. Journal of Systems Science and Complexity, 2001, 14(2): 174-178
PDF(273 KB)

157

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉