Clique covering the edges of a locally cobipartite graph

被引:6
|
作者
Chen, GT
Jacobson, MS
Kézdy, AE [1 ]
Lehel, J
Scheinerman, ER
Wang, C
机构
[1] Univ Louisville, Dept Math, Louisville, KY 40292 USA
[2] Georgia State Univ, Dept Math, Atlanta, GA 30303 USA
[3] Johns Hopkins Univ, Dept Math Sci, Baltimore, MD 21218 USA
关键词
claw free; cobipartite graph; competition graph; edge clique cover; Opsut's conjecture;
D O I
10.1016/S0012-365X(99)00333-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove that a locally cobipartite graph on n vertices contains a family of at most n cliques that cover its edges, This is related to Opsut's conjecture that states the competition number of a locally cobipartite graph is at most two. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:17 / 26
页数:10
相关论文
共 50 条
  • [1] CLIQUE COVERINGS OF THE EDGES OF A RANDOM GRAPH
    BOLLOBAS, B
    ERDOS, P
    SPENCER, J
    WEST, DB
    [J]. COMBINATORICA, 1993, 13 (01) : 1 - 5
  • [2] COVERING THE EDGES OF A GRAPH BY CIRCUITS
    KESELMAN, DY
    [J]. CYBERNETICS, 1987, 23 (03): : 306 - 313
  • [3] Covering the edges of a graph with triangles
    Bujtas, Csilla
    Davoodi, Akbar
    Ding, Laihao
    Gyori, Ervin
    Tuza, Zsolt
    Yang, Donglei
    [J]. DISCRETE MATHEMATICS, 2025, 348 (01)
  • [4] A note on covering the edges of a graph with bonds
    Neumann-Lara, V
    Rivera-Campo, E
    Urrutia, J
    [J]. DISCRETE MATHEMATICS, 1999, 197 (1-3) : 633 - 636
  • [5] Covering the edges of a connected graph by paths
    Pyber, L
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 66 (01) : 152 - 159
  • [6] COVERING THE EDGES OF A RANDOM GRAPH BY CLIQUES
    FRIEZE, A
    REED, B
    [J]. COMBINATORICA, 1995, 15 (04) : 489 - 497
  • [7] Covering the edges of a graph by three odd subgraphs
    Matrai, Tamas
    [J]. JOURNAL OF GRAPH THEORY, 2006, 53 (01) : 75 - 82
  • [8] THE MINIMUM NUMBER OF TRIANGLES COVERING THE EDGES OF A GRAPH
    LEHEL, J
    [J]. JOURNAL OF GRAPH THEORY, 1989, 13 (03) : 369 - 384
  • [9] Bounds for graph energy in terms of vertex covering and clique numbers
    Ganie, Hilal A.
    Samee, U.
    Pirzada, S.
    Alghamdi, Ahmad M.
    [J]. ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2019, 7 (02) : 315 - 328
  • [10] Covering the Edges of a Complete Geometric Graph with Convex Polygons
    Pinchasi, Rom
    Yerushalmi, Oren
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2023,