adge cover

Denote by ω(G) the edge covering number of G,and by g(G) the girth of G.

设G为图,用ω(G)和g(G)分别表示图G的边覆盖数和围长。

We consider the k-edge-covering cooperative game arising from edge covering problem on graphs.

本文针对从图的k-边覆盖问题引出的合作对策模型,利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法,并将这一结果推广到了一般的k-集合覆盖对策模型中。

A sufficient condition on the edge covering coloring of nearly bipartite graphs;

关于近似二部图边覆盖染色的一个充分条件

Edge covering coloring and fractional edge covering coloring of graphs;

图的边覆盖染色与分数边覆盖染色