A characterization of acyclic switching classes of graphs using forbidden subgraphs

被引：3
|
作者：
Hage, J
Harju, T
机构：
[1] Univ Utrecht, Inst Comp & Informat Sci, NL-3508 TB Utrecht, Netherlands
[2] Univ Turku, Dept Math, FIN-20014 Turku, Finland
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2004年 / 18卷 / 01期
关键词：
graph; switching class; Seidel switching; acyclic graph; trees; forbidden induced subgraph; critically cyclic graph;
D O I：
10.1137/S0895480100381890
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We characterize the switching classes that do not contain an acyclic graph. The characterization is by means of a set of forbidden induced subgraphs. We prove that in addition to switches of the cycles C-n for n greater than or equal to 7, there are only finitely many such graphs in 24 switching classes, all having at most 9 vertices. We give a representative of each of the 24 switching classes.
引用
收藏
页码：159 / 176
页数：18
相关论文
共 50 条
  • [41] On Forbidden Induced Subgraphs for Unit Disk Graphs
    Atminas, Aistis
    Zamaraev, Viktor
    DISCRETE & COMPUTATIONAL GEOMETRY, 2018, 60 (01) : 57 - 97
  • [42] RAMSEY PROPERTY FOR GRAPHS WITH FORBIDDEN COMPLETE SUBGRAPHS
    NESETRIL, J
    RODL, V
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 20 (03) : 243 - 249
  • [43] Forbidden subgraphs in generating graphs of finite groups
    Lucchini, Andrea
    Nemmi, Daniele
    ALGEBRAIC COMBINATORICS, 2022, 5 (05): : 925 - 946
  • [44] Forbidden Subgraphs and Weak Locally Connected Graphs
    Xia Liu
    Houyuan Lin
    Liming Xiong
    Graphs and Combinatorics, 2018, 34 : 1671 - 1690
  • [45] Graph Grabbing Game on Graphs with Forbidden Subgraphs
    Doki, Masayoshi
    Egawa, Yoshimi
    Matsumoto, Naoki
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (01) : 171 - 197
  • [46] AUTOMORPHISM-GROUPS OF GRAPHS WITH FORBIDDEN SUBGRAPHS
    BEHRENDT, G
    GRAPHS AND COMBINATORICS, 1992, 8 (03) : 203 - 206
  • [47] DOMINATING SUBGRAPHS IN GRAPHS WITH SOME FORBIDDEN STRUCTURES
    LIU, JP
    ZHOU, HS
    DISCRETE MATHEMATICS, 1994, 135 (1-3) : 163 - 168
  • [48] Regular graphs whose subgraphs tend to be acyclic
    Alon, Noga
    Bachmat, Eitan
    RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (03) : 324 - 337
  • [49] ON SWITCHING NONSEPARABLE GRAPHS WITH SWITCHING SEPARABLE SUBGRAPHS
    Bespalov, E. A.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2014, 11 : 988 - 998
  • [50] Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
    Atminas, A.
    Brignall, R.
    Lozin, V
    Stacho, J.
    DISCRETE APPLIED MATHEMATICS, 2021, 295 : 57 - 69
12345