A NOTE ON BIPARTITE SUBGRAPHS OF TRIANGLE-FREE REGULAR GRAPHS

被引:7
作者
LOCKE, SC
机构
关键词
D O I
10.1002/jgt.3190140206
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free r‐regular graph are presented. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码:181 / 185
页数:5
相关论文
共 7 条
[1]   LARGEST BIPARTITE SUBGRAPHS IN TRIANGLE-FREE GRAPHS WITH MAXIMUM DEGREE 3 [J].
BONDY, JA ;
LOCKE, SC .
JOURNAL OF GRAPH THEORY, 1986, 10 (04) :477-504
[2]   EXTREMAL BIPARTITE SUBGRAPHS OF CUBIC TRIANGLE-FREE GRAPHS [J].
HOPKINS, G ;
STATON, W .
JOURNAL OF GRAPH THEORY, 1982, 6 (02) :115-121
[3]   BIPARTITE DENSITY AND THE INDEPENDENCE RATIO [J].
LOCKE, SC .
JOURNAL OF GRAPH THEORY, 1986, 10 (01) :47-53
[4]   MAXIMUM K-COLORABLE SUBGRAPHS [J].
LOCKE, SC .
JOURNAL OF GRAPH THEORY, 1982, 6 (02) :123-132
[5]  
LOCKE SC, 1982, THESIS U WATERLOO
[6]   ON MAXIMUM BIPARTITE SUBGRAPHS [J].
MALLE, G .
JOURNAL OF GRAPH THEORY, 1982, 6 (02) :105-113
[7]  
ZYKA O, 1989, UNPUB J GRAPH THEORY