WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS

被引：1
|
作者：
McKee, Terry A. [1 ]
机构：
[1] Wright State Univ, Dept Math & Stat, Dayton, OH 45435 USA
来源：
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2013年 / 5卷 / 03期
关键词：
Chordal graph; independent separator graph; unichord-free graph; extreme separator graph;
D O I：
10.1142/S1793830913500158
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The graphs in which every minimal vertex separator induces a complete or an edgeless subgraph are shown to be the edge sums of graphs of the two extreme types: (i) when every minimal vertex separator induces a complete subgraph - these are precisely the well-studied chordal graphs - and (ii) when every minimal vertex separator induces an edgeless subgraph - these have appeared in several recent papers.
引用
收藏
页数：7
相关论文
共 50 条
  • [1] REQUIRING THAT MINIMAL SEPARATORS INDUCE COMPLETE MULTIPARTITE SUBGRAPHS
    McKee, Terry A.
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) : 263 - 273
  • [2] Graphs with complete minimal k-vertex separators
    McKee, Terry A.
    [J]. ARS COMBINATORIA, 2012, 103 : 225 - 232
  • [3] Minimal vertex separators of chordal graphs
    Kumar, PS
    Madhavan, CEV
    [J]. DISCRETE APPLIED MATHEMATICS, 1998, 89 (1-3) : 155 - 168
  • [4] Minimal vertex Ramsey graphs and minimal forbidden subgraphs
    Borowiecka-Olszewska, M
    Drgas-Burchardt, E
    Mihók, P
    [J]. DISCRETE MATHEMATICS, 2004, 286 (1-2) : 31 - 36
  • [5] Listing all minimal separators of a graph
    Kloks, T
    Kratsch, D
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 27 (03) : 605 - 613
  • [6] Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs
    Milanic, Martin
    Pivac, Nevena
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 379 - 391
  • [7] Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE
    Pashanasangi, Noujan
    Seshadhri, C.
    [J]. PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 447 - 455
  • [8] 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 - +
  • [9] 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
  • [10] On vertex-disjoint complete bipartite subgraphs in a bipartite graph
    Wang, H
    [J]. GRAPHS AND COMBINATORICS, 1999, 15 (03) : 353 - 364
12345