Graphs with complete minimal k-vertex separators

被引：0
|
作者：
McKee, Terry A. [1 ]
机构：
[1] Wright State Univ, Dept Math & Stat, Dayton, OH 45435 USA
来源：
ARS COMBINATORIA | 2012年 / 103卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Dirac characterized chordal graphs by every minimal (2-)vertex separator inducing a complete subgraph. This generalizes to k-vertex separators and to a characterization of the class of {P(5), 2P(3)}-free chordal graphs. The correspondence between minimal 2-vertex separators of chordal graphs and the edges of their clique trees parallels a correspondence between minimal k-vertex separators of {P5, 2P3}-free chordal graphs and certain (k - 1)-edge substars of their clique trees.
引用
收藏
页码：225 / 232
页数：8
相关论文
共 50 条
  • [1] Minimal vertex separators of chordal graphs
    Kumar, PS
    Madhavan, CEV
    [J]. DISCRETE APPLIED MATHEMATICS, 1998, 89 (1-3) : 155 - 168
  • [2] On the spectral radius of graphs with k-vertex cut
    Wang, Guoping
    Huang, Qiongxiang
    Cai, Jing
    [J]. ARS COMBINATORIA, 2008, 89 : 431 - 435
  • [3] Enumerating k-Vertex Connected Components in Large Graphs
    Wen, Dong
    Qin, Lu
    Zhang, Ying
    Chang, Lijun
    Chen, Ling
    [J]. 2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, : 52 - 63
  • [4] Generating minimal spanning k-vertex connected subgraphs
    Boros, Endre
    Borys, Konrad
    Elbassioni, Khaled
    Gurvich, Vladimir
    Makino, Kazuhisa
    Rudolf, Gabor
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 222 - +
  • [5] On minimal vertex separators of dually chordal graphs: Properties and characterizations
    De Caria, Pablo
    Gutierrez, Marisa
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2627 - 2635
  • [6] Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs
    Bonnet, Edouard
    Escoffier, Bruno
    Paschos, Vangelis Th.
    Stamoulis, Georgios
    [J]. DISCRETE OPTIMIZATION, 2018, 27 : 26 - 56
  • [7] WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS
    McKee, Terry A.
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2013, 5 (03)
  • [8] K-vertex guarding simple polygons
    Salleh, Ihsan
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2009, 42 (04): : 352 - 361
  • [9] One-phase algorithm for the determination of minimal vertex separators of chordal graphs
    Markenzon, Lilian
    da Costa Pereira, Paulo Renato
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2010, 17 (06) : 683 - 690
  • [10] COMBINATORIAL APPROXIMATION OF MAXIMUM k-VERTEX COVER IN BIPARTITE GRAPHS WITHIN RATIO 0.7
    Paschos, Vangelis Th.
    [J]. RAIRO-OPERATIONS RESEARCH, 2018, 52 (01) : 305 - 314
12345