The signed maximum-clique transversal number of regular graphs

DOI10.1080/00207160.2012.657183zbMath1257.05109OpenAlexW2139825835MaRDI QIDQ4903571

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) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Clique-transversal sets of line graphs and complements of line graphs
• Bounds on the clique-transversal number of regular 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 the clique-transversal number of chordal graphs
• On covering all cliques of a chordal graph
• Variations of maximum-clique transversal sets on graphs

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