Maximum h-colourable subgraph problem in balanced graphs

被引：24
|
作者：
Dahlhaus, E
Manuel, PD
Miller, M [1 ]
机构：
[1] Univ Newcastle, Dept Comp Sci, Newcastle, NSW 2308, Australia
[2] Univ Bonn, Basser Dept comp Sci 5, D-5300 Bonn, Germany
来源：
INFORMATION PROCESSING LETTERS | 1998年 / 65卷 / 06期
关键词：
balanced graph; strongly chordal graph; balanced matrix; totally balanced matrix; k-fold clique transversal problem; maximum h-colourable subgraph problem;
D O I：
10.1016/S0020-0190(98)00019-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The k-fold clique transversal problem is to locate a minimum set Omega of vertices of a graph such that every maximal clique has at least k elements of Omega. The maximum h-colourable subgraph problem is to find a maximum subgraph of a graph which is h-colourable. We show that the k-fold clique transversal problem and the maximum h-colourable subgraph problem are polynomially solvable on balanced graphs. We also provide a polynomial algorithm to recognize balanced graphs. (C) 1998 Elsevier Science B.V.
引用
收藏
页码：301 / 303
页数：3
相关论文
共 50 条
  • [31] Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs
    Wagner, Brian C.
    GRAPHS AND COMBINATORICS, 2013, 29 (05) : 1549 - 1555
  • [32] The maximum balanced subgraph of a signed graph: Applications and solution approaches
    Figueiredo, Rosa
    Frota, Yuri
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (02) : 473 - 487
  • [33] THE DENSEST SUBGRAPH PROBLEM IN SPARSE RANDOM GRAPHS
    Anantharam, Venkat
    Salez, Justin
    ANNALS OF APPLIED PROBABILITY, 2016, 26 (01): : 305 - 327
  • [34] THE SUBGRAPH ISOMORPHISM-PROBLEM FOR OUTERPLANAR GRAPHS
    SYSLO, MM
    THEORETICAL COMPUTER SCIENCE, 1982, 17 (01) : 91 - 97
  • [35] Vertex Decompositions of Sparse Graphs into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most k
    Borodin, O. V.
    Ivanova, A. O.
    Montassier, M.
    Ochem, P.
    Raspaud, A.
    JOURNAL OF GRAPH THEORY, 2010, 65 (02) : 83 - 93
  • [36] Subgraph extraction and metaheuristics for the maximum clique problem
    Duc-Cuong Dang
    Aziz Moukrim
    Journal of Heuristics, 2012, 18 : 767 - 794
  • [37] A polyhedral study of the maximum edge subgraph problem
    Bonomo, Flavia
    Marenco, Javier
    Saban, Daniela
    Stier-Moses, Nicolas E.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2573 - 2590
  • [38] Formulations for the maximum common edge subgraph problem
    de Gastines, Etienne
    Knippel, Arnaud
    DISCRETE APPLIED MATHEMATICS, 2024, 346 : 115 - 130
  • [39] On the maximum small-world subgraph problem
    Kim, Jongeun
    Veremyev, Alexander
    Boginski, Vladimir
    Prokopyev, Oleg A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 280 (03) : 818 - 831
  • [40] Local approximations for maximum partial subgraph problem
    Monnot, J
    Paschos, VT
    Toulouse, S
    OPERATIONS RESEARCH LETTERS, 2004, 32 (03) : 217 - 224
12345