Signed and minus clique-transversal functions on graphs

DOI10.1016/j.ipl.2008.12.019zbMath1189.05071OpenAlexW2047843604MaRDI QIDQ976135

Chuan-Min Lee, Maw-Shang Chang

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.019

zbMATH Keywords

planar graphsgraph algorithmsstrongly chordal graphsminus clique-transversal functions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• Characterizations of strongly chordal graphs
• On the clique-transversal number of chordal graphs
• On clique-transversals and clique-independent sets
• On covering all cliques of a chordal graph
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• Algorithmic aspects of clique-transversal and clique-independent sets
• Doubly lexical ordering of dense 0--1 matrices
• The algorithmic complexity of the minus clique-transversal problem
• Distance-hereditary graphs are clique-perfect
• Triangulated graphs and the elimination process
• Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
• Three Partition Refinement Algorithms

This page was built for publication: Signed and minus clique-transversal functions on graphs