Characterizations for restricted graphs of NLC-width 2

被引：2
|
作者：
Gurski, Frank [1 ]
机构：
[1] Univ Dusseldorf, Inst Comp Sci, D-40225 Dusseldorf, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 372卷 / 01期
关键词：
NLC-width; NLCT-width; linear NLC-width; graph characterizations;
D O I：
10.1016/j.tcs.2006.12.010
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we give a finite forbidden subgraph characterization of graphs defined by NLC-width 2-expressions, by NLCT-width 2-expressions, or by linear NLC-width 2-expressions that have tree-width 1. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：108 / 114
页数：7
相关论文
共 50 条
  • [21] Characterizations of arboricity of graphs
    Haas, R
    ARS COMBINATORIA, 2002, 63 : 129 - 137
  • [22] ON THE SPECTRAL CHARACTERIZATIONS OF GRAPHS
    Huang, Jing
    Li, Shuchao
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (03) : 729 - 744
  • [23] Characterizations of Certain Types of Type 2 Soft Graphs
    Hayat, Khizar
    Cao, Bing-Yuan
    Ali, Muhammad Irfan
    Karaaslan, Faruk
    Qin, Zejian
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2018, 2018
  • [24] CHARACTERIZATIONS OF 2ND ITERATED LINE GRAPHS
    ZHAO, GF
    JOURNAL OF GRAPH THEORY, 1988, 12 (02) : 285 - 294
  • [25] An application of Hoffman graphs for spectral characterizations of graphs
    Yang, Qianqian
    Abiad, Aida
    Koolen, Jack H.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (01):
  • [26] Characterizations of line graphs in signed and gain graphs
    Cavaleri, Matteo
    D'Angeli, Daniele
    Donno, Alfredo
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 102
  • [27] On Characterizations of Rigid Graphs in the Plane Using Spanning TreesOn Characterizations of Rigid Graphs in the Plane
    Sergey Bereg
    Graphs and Combinatorics, 2009, 25 : 139 - 144
  • [28] On Characterizations of Rigid Graphs in the Plane Using Spanning Trees On Characterizations of Rigid Graphs in the Plane
    Bereg, Sergey
    GRAPHS AND COMBINATORICS, 2009, 25 (02) : 139 - 144
  • [29] The Characterizations and Complexity of Roman {2}-Domination and 2-Domination in Graphs
    School of Mathematics and Statistics, Gansu Center for Applied Mathematics, Lanzhou University, Gansu, Lanzhou
    730000, China
    不详
    730000, China
    Lect. Notes Comput. Sci., (182-193):
  • [30] Characterizing graphs of maximum matching width at most 2
    Jeong, Jisu
    Ok, Seongmin
    Suh, Geewon
    DISCRETE APPLIED MATHEMATICS, 2018, 248 : 102 - 113
12345