Hamiltonicity in graphs with few P4's

被引:0
|
作者
University of Cologne, Cologne, D-50931, Germany [1 ]
不详 [2 ]
机构
来源
Comput Vienna New York | / 3卷 / 213-225期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Graph theory
引用
收藏
相关论文
共 50 条
  • [1] HAMILTONICITY IN GRAPHS WITH FEW P-4S
    HOCHSTATTLER, W
    TINHOFER, G
    COMPUTING, 1995, 54 (03) : 213 - 225
  • [2] Triangulating graphs with few P4's
    Babel, L
    DISCRETE APPLIED MATHEMATICS, 1998, 89 (1-3) : 45 - 57
  • [3] The clique operator on graphs with few P4's
    de Mello, CP
    Morgana, A
    Liverani, M
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 485 - 492
  • [4] On the Grundy number of graphs with few P4's
    Araujo, J.
    Linhares Sales, C.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2514 - 2522
  • [5] Efficient algorithms for graphs with few P4'S
    Babel, L
    Kloks, T
    Kratochvíl, J
    Kratsch, D
    Müller, H
    Olariu, S
    DISCRETE MATHEMATICS, 2001, 235 (1-3) : 29 - 51
  • [6] Restricted coloring problems on Graphs with few P4's
    Linhares-Sales, Claudia
    Maia, Ana Karolinna
    Martins, Nicolas
    Sampaio, Rudini M.
    ANNALS OF OPERATIONS RESEARCH, 2014, 217 (01) : 385 - 397
  • [7] Bandwidth and topological bandwidth of graphs with few P4's
    Kloks, T
    Tan, RB
    DISCRETE APPLIED MATHEMATICS, 2001, 115 (1-3) : 117 - 133
  • [8] Restricted coloring problems on Graphs with few P4’s
    Cláudia Linhares-Sales
    Ana Karolinna Maia
    Nicolas Martins
    Rudini M. Sampaio
    Annals of Operations Research, 2014, 217 : 385 - 397
  • [9] Clique cycle transversals in graphs with few P4's
    Bravo, Raquel S. F.
    Klein, Sulamita
    Nogueira, Loana Tito
    Protti, Fabio
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2013, 15 (03): : 13 - 20
  • [10] On Hamiltonicity of vertex-transitive graphs and digraphs of order p4
    Che, YQ
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 72 (01) : 110 - 121