期刊文献+

GRAPH DECOMPOSITION WITH CONSTRAINT ON THE MINIMUM DEGREE

GRAPH DECOMPOSITION WITH CONSTRAINT ON THE MINIMUM DEGREE
原文传递
导出
摘要 Ⅰ. BACKGROUND AND NOTATIONS In this paper all graphs will be finite, undirected, and have no loops or multiple edges, namely, simple graphs. E. Gyovi put the following question: Is there a (the smallest) natural number f(s,t) such that the vertex set of each graph of connectivity being f (s, t) at least has a decomposition into sets which would induce subgraphs of connectivity being
作者 施容华
出处 《Chinese Science Bulletin》 SCIE EI CAS 1985年第9期1143-1146,共4页
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部