Signed clique-transversal functions in graphs

DOI10.1080/00207160902822330zbMath1198.05146OpenAlexW2065614946MaRDI QIDQ3056375

Hai-Chao Wang, Erfang Shan, Li-ying Kang

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160902822330

zbMATH Keywords

NP-completestrongly chordal graphdoubly chordal graphsigned clique-transversal function

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Clique-transversal sets of line graphs and complements of line graphs
• Variations of \(Y\)-dominating functions on graphs
• Bounds on the clique-transversal number of regular graphs
• Characterizations of strongly chordal graphs
• Covering the cliques of a graph with vertices
• On the clique-transversal number of chordal graphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• On clique-transversals and clique-independent sets
• 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
• Three Partition Refinement Algorithms
• Doubly chordal graphs, steiner trees, and connected domination

This page was built for publication: Signed clique-transversal functions in graphs