Forbidding and enforcing on graphs

被引：3
|
作者：
Genova, Daniela [2 ]
Jonoska, Natasa [1 ]
机构：
[1] Univ S Florida, Dept Math & Stat, Tampa, FL 33620 USA
[2] Univ N Florida, Dept Math & Stat, Jacksonville, FL 32224 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2012年 / 429卷
基金：
美国国家科学基金会;
关键词：
Forbidding enforcing; fe-systems; Graphs; Subgraphs; k-regular; k-colorability;
D O I：
10.1016/j.tcs.2011.12.029
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We define classes of graphs based on forbidding and enforcing boundary conditions. Forbidding conditions prevent a graph to have certain combinations of subgraphs and enforcing conditions impose certain subgraph structures. We say that a class of graphs is an fe-class if the class can be defined through forbidding and enforcing conditions (fe-system). We investigate properties of fe-systems and characterize familiar classes of graphs such as paths and cycles, trees, bi-partite, complete, Eulerian, and k-regular graphs as fe-classes. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：108 / 117
页数：10
相关论文
共 50 条
  • [1] Forbidding and enforcing in membrane computing
    Matteo Cavaliere
    Nataša Jonoska
    Natural Computing, 2003, 2 (3) : 215 - 228
  • [2] Forbidding-enforcing systems
    Ehrenfeucht, A
    Rozenberg, G
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (03) : 611 - 638
  • [3] Sequences of languages in forbidding–enforcing families
    A. Ehrenfeucht
    H. J. Hoogeboom
    G. Rozenberg
    N. van Vugt
    Soft Computing, 2001, 5 (2) : 121 - 125
  • [4] Defining structures through forbidding and enforcing constraints
    Genova, Daniela
    Jonoska, Natasa
    PHYSICA B-CONDENSED MATTER, 2007, 394 (02) : 306 - 310
  • [5] Finite Language Forbidding-Enforcing Systems
    Genova, Daniela
    Hoogeboom, Hendrik Jan
    UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 258 - 269
  • [6] Forbidding Kuratowski Graphs as Immersions
    Giannopoulou, Archontia C.
    Kaminski, Marcin
    Thilikos, Dimitrios M.
    JOURNAL OF GRAPH THEORY, 2015, 78 (01) : 43 - 60
  • [7] Forbidding Multiple Copies of Forestable Graphs
    Neal Bushaw
    Nathan Kettle
    Graphs and Combinatorics, 2020, 36 : 459 - 467
  • [8] Forbidding Multiple Copies of Forestable Graphs
    Bushaw, Neal
    Kettle, Nathan
    GRAPHS AND COMBINATORICS, 2020, 36 (03) : 459 - 467
  • [9] On Aa spectral extrema of graphs forbidding even cycles
    Li, Shuchao
    Yu, Yuantian
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 668 : 11 - 27
  • [10] Proper rainbow-cycle-forbidding edge colorings of graphs
    Hoffman, Dean
    Johnson, Peter
    Noble, Matt
    Owens, Andrew
    Puleo, Gregory j.
    Terry, Nico
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2024, 90 : 281 - 312
12345