HAMILTONian circuits in chordal bipartite graphs

被引：97
|
作者：
Muller, H [1 ]
机构：
[1] UNIV JENA,FAK MATH & INFORMAT,D-07740 JENA,GERMANY
来源：
DISCRETE MATHEMATICS | 1996年 / 156卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(95)00057-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The main result of this paper is the NP-completeness of the HAMILTONIAN CIRCUIT problem for chordal bipartite graphs. This is proved by a sophisticated reduction from SATISFIABILITY. As a corollary, HAMILTONIAN CIRCUIT is NP-complete for strongly chordal split graphs. On both classes the complexity of the HAMILTONIAN PATH problem coincides with the complexity of HAMILTONIAN CIRCUIT. Further, we show that HAMILTONIAN CIRCUIT is linear-time solvable for convex bipartite graphs.
引用
收藏
页码：291 / 298
页数：8
相关论文
共 50 条
  • [1] Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
    McKee, TA
    DISCRETE MATHEMATICS, 2003, 260 (1-3) : 231 - 238
  • [2] Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
    Marthe Bonamy
    Matthew Johnson
    Ioannis Lignos
    Viresh Patel
    Daniël Paulusma
    Journal of Combinatorial Optimization, 2014, 27 : 132 - 143
  • [3] Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
    Bonamy, Marthe
    Johnson, Matthew
    Lignos, Ioannis
    Patel, Viresh
    Paulusma, Daniel
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 132 - 143
  • [4] TREEWIDTH OF CHORDAL BIPARTITE GRAPHS
    KLOKS, T
    KRATSCH, D
    JOURNAL OF ALGORITHMS, 1995, 19 (02) : 266 - 281
  • [5] CHORDAL BIPARTITE GRAPHS AND CROWNS
    BOUCHITTE, V
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1985, 2 (02): : 119 - 122
  • [6] Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
    Uehara, R
    Toda, S
    Nagoya, T
    DISCRETE APPLIED MATHEMATICS, 2005, 145 (03) : 479 - 482
  • [7] On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
    de Figueiredo, C. M. H.
    Faria, L.
    Klein, S.
    Sritharan, R.
    THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 57 - 67
  • [8] Strongly chordal and chordal bipartite graphs are sandwich monotone
    Pinar Heggernes
    Federico Mancini
    Charis Papadopoulos
    R. Sritharan
    Journal of Combinatorial Optimization, 2011, 22 : 438 - 456
  • [9] Classes of bipartite graphs related to chordal graphs
    1600, (32):
  • [10] Strongly chordal and chordal bipartite graphs are sandwich monotone
    Heggernes, Pinar
    Mancini, Federico
    Papadopoulos, Charis
    Sritharan, R.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (03) : 438 - 456
12345