Matching cutsets in graphs of diameter 2

被引：15
|
作者：
Borowiecki, Mieuyslaw [1 ]
Jesse-Jozefczyk, Katarzyna [1 ]
机构：
[1] Univ Zielona Gora, Fac Math Comp Sci & Econometr, PL-65516 Zielona Gora, Poland
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 407卷 / 1-3期
关键词：
Matching cutset; Stable cutset; Graph algorithms;
D O I：
10.1016/j.tcs.2008.07.002
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We say that a graph has a matching cutset if its vertices can be coloured in red and blue in such a way that there exists at least one vertex coloured in red and at least one vertex coloured in blue, and every vertex has at most one neighbour Coloured in the opposite colour. In this paper we study the algorithmic complexity of a problem of recognizing graphs which possess a matching cutset. In particular we present a polynomial-time algorithm which solves this problem for graphs of diameter two. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：574 / 582
页数：9
相关论文
共 50 条
  • [31] Clique-cutsets beyond chordal graphs
    Boncompagni, Valerio
    Penev, Irena
    Vuskovic, Kristina
    JOURNAL OF GRAPH THEORY, 2019, 91 (02) : 192 - 246
  • [32] An algorithm for generating minimal cutsets of undirected graphs
    Yong Yeon Shin
    Jai Sang Koh
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (3): : 681 - 693
  • [33] ON SLIM GRAPHS, EVEN PAIRS, AND STAR-CUTSETS
    HOANG, CT
    MAFFRAY, F
    DISCRETE MATHEMATICS, 1992, 105 (1-3) : 93 - 102
  • [34] Algorithm of finding cutsets of sparse simple connected graphs
    Jiche Dianchuandong, 2 (3-5):
  • [35] Disjoint clique cutsets in graphs without long holes
    Eschen, EM
    Hoàng, CT
    Petrick, MDT
    Sritharan, R
    JOURNAL OF GRAPH THEORY, 2005, 48 (04) : 277 - 298
  • [36] Minimal oriented graphs of diameter 2
    Füredi, Z
    Horak, P
    Pareek, CM
    Zhu, XD
    GRAPHS AND COMBINATORICS, 1998, 14 (04) : 345 - 350
  • [37] REDUCED GRAPHS OF DIAMETER-2
    LAI, HJ
    JOURNAL OF GRAPH THEORY, 1990, 14 (01) : 77 - 87
  • [38] Minimal Oriented Graphs of Diameter 2
    Zoltán Füredi
    Peter Horak
    Chandra M. Pareek
    Xuding Zhu
    Graphs and Combinatorics, 1998, 14 (4) : 345 - 350
  • [39] PROBABILITY OF DIAMETER 2 FOR STEINHAUS GRAPHS
    BRAND, N
    CURRAN, S
    DAS, S
    JACOB, T
    DISCRETE APPLIED MATHEMATICS, 1993, 41 (02) : 165 - 171
  • [40] THE MAXIMUM GENUS OF GRAPHS OF DIAMETER 2
    SKOVIERA, M
    DISCRETE MATHEMATICS, 1991, 87 (02) : 175 - 180
12345