云南高校图书馆联盟文献共享服务平台- MULTIGRAPHS

MULTIGRAPHS: 作品数：12被引量：3H指数：1; 导出分析报告; 相关领域：理学更多>>; 相关期刊：《Science China Mathematics》《Algebra Colloquium》《Acta Mathematicae Applicatae Sinica》《Acta Mathematica Scientia》更多>>; 相关基金：国家自然科学基金国家教育部博士点基金更多>>

-

在结果中检索

检索结果分析

结果分析中...

选择条件：

期刊=Science China Mathematics

共条记录，以下是1-3

全选清除导出

参考文献引证文献引用追踪

视图：

排序：

The spectrum of path factorization of bipartite multigraphs: 《Science China Mathematics》2007年第7期1045-1054,共10页Jian WANG~1 Bei-liang DU~(2+) 1 Nantong Vocational College,Nantong 226007,China 2 Department of Mathematics,Suzhou University,Suzhou 215006,China; This work was supported by the National Natural Science Foundation of China(Grant No.10571133).; Let λK m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P v-factorization of λK m,n is a set of edge-disjoint P v-factors of λK m,n which partition the set of edges of λ...; 关键词：bipartite multigraph FACTORIZATION 05B30 05C70

Partitioning series-parallel multigraphs into υ*-excluding edge covers: 《Science China Mathematics》2006年第8期1082-1093,共12页LIU Guizhen, DENG Xiaotie & XU Changqing School of Mathematics and System Science, Shandong University, Jinan 250100, China Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China Department of Applied Mathematics, Hebei University of Technology, Tianjin 300130, China; This work was partially supported by the National Natural Science Foundation of China(Grant No.10471078);the Special Research Foundation for the Doctoral Program of Higher Education of China(Grant No.20040422004);Hong Kong Research Grants Council(Grant No.CityU 1056/01E).; We prove that, for any given vertexν* in a series-parallel graph G, its edge set can be partitioned into k= min{k′(G) + 1,δ(G)} subsets such that each subset covers all the vertices of G possibly except forν*, wh...; 关键词：SERIES-PARALLEL graph edge-connectivity EDGE cover coloring MIN-MAX theorem.

P_(4k-1)-factorization of bipartite multigraphs被引量：1: 《Science China Mathematics》2006年第7期961-970,共10页WANG Jian & DU Beiliang Nantong Vocational College, Nantong 226007, China Department of Mathematics, Suzhou University, Suzhou 215006, China; This work was supported by the National Natural Science Foundation of China (Grant No. 10571133).; LetλKm,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A Pν-factorization ofλKm,n is a set of edge-disjoint Pν-factors ofλKm,n which partition the set of edges ofλKm,n. W...; 关键词：BIPARTITE multigraph factor factorization.

全选清除导出

共1页<1>

检索报告对象比较聚类工具使用帮助返回顶部