CHARACTERIZING ATOMS THAT RESULT FROM DECOMPOSITION BY CLIQUE SEPARATORS

被引：0
|
作者：
McKee, Terry A. [1 ]
机构：
[1] Wright State Univ, Dept Math & Stat, Dayton, OH 45435 USA
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2017年 / 37卷 / 03期
关键词：
clique separator; minimal separator; unichord-free graph;
D O I：
10.7151/dmgt.1944
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is defined to be an atom if no minimal vertex separator induces a complete subgraph; thus, atoms are the graphs that are immune to clique separator decomposition. Atoms are characterized here in two ways: first using generalized vertex elimination schemes, and then as generalizations of 2-connected unichord-free graphs (the graphs in which every minimal vertex separator induces an edgeless subgraph).
引用
收藏
页码：587 / 594
页数：8
相关论文
共 50 条
  • [11] EFFICIENT REGISTER ALLOCATION VIA COLORING USING CLIQUE SEPARATORS
    GUPTA, R
    SOFFA, ML
    OMBRES, D
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 370 - 386
  • [12] THE GREEDY CLIQUE DECOMPOSITION OF A GRAPH
    MCGUINNESS, S
    JOURNAL OF GRAPH THEORY, 1994, 18 (04) : 427 - 430
  • [13] EXTENSION OF A CLIQUE COVER RESULT TO UNIFORM HYPERGRAPHS
    SHELTON, AP
    DUTTON, RD
    BRIGHAM, RC
    DISCRETE MATHEMATICS, 1986, 59 (1-2) : 199 - 201
  • [14] CP decomposition and weighted clique problem
    Zhang, Tonglin
    STATISTICS & PROBABILITY LETTERS, 2020, 161
  • [15] Clique-width: Harnessing the power of atoms
    Dabrowski, Konrad K. K.
    Masarik, Tomas
    Novotna, Jana
    Paulusma, Daniel
    Rzazewski, Pawel
    JOURNAL OF GRAPH THEORY, 2023, 104 (04) : 769 - 810
  • [16] The Clique Minimal Separator Decomposition of a Hypergraph
    Bykova, V. V.
    JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS, 2012, 5 (01): : 36 - 45
  • [17] An Introduction to Clique Minimal Separator Decomposition
    Berry, Anne
    Pogorelcnik, Romain
    Simonet, Genevieve
    ALGORITHMS, 2010, 3 (02) : 197 - 215
  • [18] Clique-Width: Harnessing the Power of Atoms
    Dabrowski, Konrad K.
    Masarik, Tomas
    Novotna, Jana
    Paulusma, Daniel
    Rzazewski, Pawel
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 119 - 133
  • [19] On the size of minimal separators for treedepth decomposition
    Xu, Zijian
    Suppakitpaisarn, Vorapong
    DISCRETE APPLIED MATHEMATICS, 2024, 354 : 262 - 270
  • [20] DECOMPOSITION OF CONVEX FIELDS BY MINIMAL SEPARATORS
    BOKOWSKI, J
    SPERNER, E
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1979, 311 : 80 - 100
12345