transversal numbers
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 2)

H-INDEX

7
(FIVE YEARS 0)

Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 22
Author(s):  
Chuan-Min Lee

This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k-trees, suns, planar graphs, doubly chordal graphs, clique perfect graphs, total graphs, split graphs, line graphs, and dually chordal graphs. We give equations to compute the {k}-clique, minus clique, signed clique, and k-fold clique transversal numbers for suns, and show that the {k}-clique transversal problem is polynomial-time solvable for graphs whose clique transversal numbers equal their clique independence numbers. We also show the relationship between the signed and generalization clique problems and present NP-completeness results for the considered problems on k-trees with unbounded k, planar graphs, doubly chordal graphs, total graphs, split graphs, line graphs, and dually chordal graphs.


2013 ◽  
Vol 44 ◽  
pp. 133-139
Author(s):  
A. Vázquez-Ávila ◽  
G. Araujo-Pardo ◽  
A. Montejano ◽  
L. Montejano

2013 ◽  
Vol 161 (13-14) ◽  
pp. 1859-1867 ◽  
Author(s):  
S. Arumugam ◽  
Bibin K. Jose ◽  
Csilla Bujtás ◽  
Zsolt Tuza
Keyword(s):  

2006 ◽  
Vol 306 (18) ◽  
pp. 2166-2173 ◽  
Author(s):  
Seog-Jin Kim ◽  
Kittikorn Nakprasit ◽  
Michael J. Pelsmajer ◽  
Jozef Skokan

2002 ◽  
Vol 29 (1) ◽  
pp. 79-101 ◽  
Author(s):  
Noga Alon ◽  
Gil Kalai ◽  
Jiřı́ Matoušek ◽  
Roy Meshulam
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document