Graphs with Branchwidth at Most Three

被引：0
|
作者：
Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, Netherlands [1 ]
不详 [2 ]
机构：
来源：
J Algorithms | / 2卷 / 167-194期
关键词：
* This paper is the full version of part of the paper titled ``Constructive Linear Time Algorithms for Branchwidth'' which appeared in the ``Proceedings of ICALP'97'' (see w7x). The research was partially supported by ESPRIT Long Term Research Project 20244 (Project ALCOM IT: Algorithms and Complexity in Information Technology);
D O I：
暂无
中图分类号：
学科分类号：
摘要：
23
引用
收藏
相关论文
共 50 条
  • [1] Graphs with branchwidth at most three
    Bodlaender, HL
    Thilikos, DM
    [J]. JOURNAL OF ALGORITHMS, 1999, 32 (02) : 167 - 194
  • [2] Branchwidth of chordal graphs
    Paul, Christophe
    Telle, Jan Arne
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (12) : 2718 - 2725
  • [3] Generation of graphs with bounded branchwidth
    Paul, Christophe
    Proskurowski, Andrzej
    Telle, Jan Arne
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 205 - +
  • [4] The branchwidth of graphs and their cycle matroids
    Hicks, Illya V.
    McMurray, Nolan B., Jr.
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (05) : 681 - 692
  • [5] Computing the branchwidth of interval graphs
    Kloks, T
    Kratochvíl, J
    Müller, H
    [J]. DISCRETE APPLIED MATHEMATICS, 2005, 145 (02) : 266 - 275
  • [6] Graphs, branchwidth, and tangles! Oh my!
    Hicks, YV
    [J]. NETWORKS, 2005, 45 (02) : 55 - 60
  • [7] (Total) Vector domination for graphs with bounded branchwidth
    Ishii, Toshimasa
    Ono, Hirotaka
    Uno, Yushi
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 207 : 80 - 89
  • [8] (Total) Vector Domination for Graphs with Bounded Branchwidth
    Ishii, Toshimasa
    Ono, Hirotaka
    Uno, Yushi
    [J]. LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 238 - 249
  • [9] Signed graphs with at most three eigenvalues
    Farzaneh Ramezani
    Peter Rowlinson
    Zoran Stanić
    [J]. Czechoslovak Mathematical Journal, 2022, 72 : 59 - 77
  • [10] Ramanujan graphs with diameter at most three
    Ebrahimi, Mahdi
    [J]. arXiv,
12345