Signed clique-transversal functions in graphs

DOI10.1080/00207160902822330MaRDI QIDQ3056375zbMATH OpenOpenAlexFDO

Authors Haichao Wang, Erfang Shan, Liying 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)

Recommendations

• Signed and minus clique-transversal functions on graphs
• The signed maximum-clique transversal number of regular graphs
• The algorithmic complexity of the minus clique-transversal problem
• Bounds on the clique-transversal number of regular graphs
• Clique-transversal sets in 4-regular claw-free graphs

Cites work

• Algorithmic aspects of clique-transversal and clique-independent sets
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Bounds on the clique-transversal number of regular graphs
• Characterizations of strongly chordal graphs
• Clique-transversal sets of line graphs and complements of line graphs
• Covering the cliques of a graph with vertices
• Distance-hereditary graphs are clique-perfect
• Doubly chordal graphs, steiner trees, and connected domination
• Doubly lexical ordering of dense 0--1 matrices
• Graph theory with applications
• On clique-transversals and clique-independent sets
• On the clique-transversal number of chordal graphs
• The algorithmic complexity of the minus clique-transversal problem
• Three Partition Refinement Algorithms
• Variations of \(Y\)-dominating functions on graphs

Cited in

(2)

• Signed and minus clique-transversal functions on graphs
• The signed maximum-clique transversal number of regular graphs

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

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