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.
机构:
East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
NanKai Univ, Sch Math Sci, Tianjin 300071, Peoples R ChinaEast China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
Wang, Zhiwen
Liu, Shuting
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Univ Sci & Technol, Coll Math & Syst Sci, Qingdao 266590, Shandong, Peoples R ChinaEast China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
机构:
NYU, Courant Inst Math Sci, New York, NY 10012 USANYU, Courant Inst Math Sci, New York, NY 10012 USA
Pach, Janos
Sharir, Micha
论文数: 0引用数: 0
h-index: 0
机构:
NYU, Courant Inst Math Sci, New York, NY 10012 USA
Tel Aviv Univ, Sch Comp Sci, IL-69978 Tel Aviv, IsraelNYU, Courant Inst Math Sci, New York, NY 10012 USA