scientific article; zbMATH DE number 2044919

zbMATH Open1042.68619MaRDI QIDQ4448744FDOQ4448744

Authors: Ton Kloks, Chuan-Min Lee, Maw-Shang Chang 

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040032.htm

Title of this publication is not available (Why is that?)

Recommendations

• Variations of maximum-clique transversal sets on graphs
• The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
• Weighted maximum-clique transversal sets of graphs
• The clique-transversal set problem in claw-free graphs with degree at most 4
• Clique-transversal sets and weak 2-colorings in graphs of small maximum degree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (13)

• Algorithmic aspects of clique-transversal and clique-independent sets
• Optimal‐size clique transversals in chordal graphs
• Weighted maximum-clique transversal sets of graphs
• Linearity of grid minors in treewidth with applications through bidimensionality
• On blockers and transversals of maximum independent sets in co-comparability graphs
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Variations of maximum-clique transversal sets on graphs
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Inapproximability of $H$-Transversal/Packing
• Algorithms for finding clique-transversals of graphs
• Distance-hereditary graphs are clique-perfect
• The signed maximum-clique transversal number of regular graphs
• Clique-transversal sets and weak 2-colorings in graphs of small maximum degree

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448744)