On the decomposition of graphs into complete bipartite graphs

被引：4
|
作者：
Dong, Jinquan [1 ]
Liu, Yanpei
机构：
[1] Inner Mongolia Univ Technol, Sch Management, Hohhot 010051, Peoples R China
[2] Jiao Tong Univ, Inst Appl Math, Beijing 100044, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2007年 / 23卷 / 03期
关键词：
complete bipartite decomposition; complete bipartite valency; orientation;
D O I：
10.1007/s00373-007-0722-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In a complete bipartite decomposition pi of a graph, we consider the number v(upsilon;pi) of complete bipartite subgraphs incident with a vertex v. Let v(G)= [GRAPHICS] In this paper the exact values of v(G) for complete graphs and hypercubes and a sharp upper bound on v(G) for planar graphs are provided, respectively. An open problem proposed by P.C. Fishburn and P.L. Hammer is solved as well.
引用
收藏
页码：255 / 262
页数：8
相关论文
共 50 条
12345