On quadrilaterals in a graph

被引：15
|
作者：
Randerath, B
Schiermeyer, I
Wang, H
机构：
[1] Univ Cologne, Inst Informat, D-50969 Cologne, Germany
[2] Tech Univ Cottbus, Lehrstuhl Diskrete Math & Grundlagen Informat, D-03013 Cottbus, Germany
[3] Univ Idaho, Dept Math, Moscow, ID 83844 USA
来源：
DISCRETE MATHEMATICS | 1999年 / 203卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(99)00053-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be a graph of order 4k, where k is a positive integer. Suppose that the minimum degree of G is at least 2k. We show that G contains k - 1 quadrilaterals and a subgraph of order 4 with at least 4 edges such that all of them are mutually vertex-disjoint. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：229 / 237
页数：9
相关论文
共 50 条
12345