The signed maximum-clique transversal number of regular graphs

DOI10.1080/00207160.2012.657183MaRDI QIDQ4903571zbMATH OpenOpenAlexFDO

Authors Dingguo Wang, Erfang Shan

Publication date 22 January 2013

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

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

zbMATH Keywords

regular graphclaw-freemaximum-clique transversal setsigned maximum-clique transversal number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Transversal (matching) theory (05D15)

Recommendations

• Signed clique-transversal functions in graphs
• Bounds on the clique-transversal number of regular graphs
• Signed and minus clique-transversal functions on graphs
• On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
• Signed domination in regular graphs

Cites work

• scientific article; zbMATH DE number 2044919 (Why is no real title available?)
• Bounds on the clique-transversal number of regular graphs
• Clique-transversal sets of line graphs and complements of line graphs
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• Finding independent sets in \(K_4\)-free 4-regular connected graphs
• On covering all cliques of a chordal graph
• On the clique-transversal number of chordal graphs
• Variations of maximum-clique transversal sets on graphs

Cited in

(3)

• The relative signed clique number of planar graphs is 8
• Signed and minus clique-transversal functions on graphs
• Signed clique-transversal functions in graphs

This page was built for publication: The signed maximum-clique transversal number of regular graphs

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