Signed clique-transversal functions in graphs
DOI10.1080/00207160902822330zbMATH Open1198.05146OpenAlexW2065614946MaRDI QIDQ3056375FDOQ3056375
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
Recommendations
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
- Graph theory with applications
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Doubly lexical ordering of dense 0--1 matrices
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- Bounds on the clique-transversal number of regular graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Distance-hereditary graphs are clique-perfect
- Covering the cliques of a graph with vertices
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Clique-transversal sets of line graphs and complements of line graphs
- On the clique-transversal number of chordal graphs
- The algorithmic complexity of the minus clique-transversal problem
- Doubly chordal graphs, steiner trees, and connected domination
- Variations of \(Y\)-dominating functions on graphs
Cited In (2)
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)
