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 条
  • [41] Maximum nullity and zero forcing number on graphs with maximum degree at most three
    Alishahi, Meysam
    Rezaei-Sani, Elahe
    Sharifi, Elahe
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 284 : 179 - 194
  • [42] A SAT Approach to Branchwidth
    Lodha, Neha
    Ordyniak, Sebastian
    Szeider, Stefan
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2019, 20 (03)
  • [43] A SAT Approach to Branchwidth
    Lodha, Neha
    Ordyniak, Sebastian
    Szeider, Stefan
    [J]. PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4894 - 4898
  • [44] New branchwidth territories
    Kloks, T
    Kratochvíl, J
    Müller, H
    [J]. STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 173 - 183
  • [45] Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices
    Potocnik, Primoz
    Toledo, Micael
    [J]. DISCRETE MATHEMATICS, 2021, 344 (02)
  • [46] Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
    Das, Bireswar
    Enduri, Murali Krishna
    Reddy, I. Vinod
    [J]. COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 55 - 66
  • [47] Graphs with at Most Three Distance Eigenvalues Different from-1 and-2
    Huang, Xueyi
    Huang, Qiongxiang
    Lu, Lu
    [J]. GRAPHS AND COMBINATORICS, 2018, 34 (03) : 395 - 414
  • [48] Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
    Jin, Wei
    Praeger, Cheryl E.
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2021, 178
  • [49] Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
    Das, Bireswar
    Enduri, Murali Krishna
    Reddy, I. Vinod
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 819 (819) : 9 - 23
  • [50] GRAPHS OF DIAMETER AT MOST 2
    LAI, HJ
    [J]. ARS COMBINATORIA, 1992, 34 : 331 - 343
12345