Clique-transversal number of graphs whose clique-graphs are trees

DOI10.1007/s11741-008-0302-3zbMath1174.05458OpenAlexW2005033095MaRDI QIDQ5320228

Zuosong Liang, Erfang Shan

Publication date: 22 July 2009

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-008-0302-3

zbMATH Keywords

treeclique-transversal numberclique-graph

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Edge contraction and edge removal on iterated clique graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum \(h\)-colourable subgraph problem in balanced graphs
• Clique-transversal sets of line graphs and complements of line graphs
• Chains, antichains, and fibres
• Covering all cliques of a graph
• 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
• Distance-hereditary graphs are clique-perfect
• A characterization of clique graphs
• Clique-Transversal Sets in Cubic Graphs
• Algorithmic Aspects of Neighborhood Numbers

This page was built for publication: Clique-transversal number of graphs whose clique-graphs are trees