Pages that link to "Item:Q1910588"

The following pages link to On covering all cliques of a chordal graph (Q1910588):

Displaying 11 items.

• The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
• Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
• The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
• Signed and minus clique-transversal functions on graphs (Q976135) (← links)
• On the clique-transversal number of chordal graphs (Q1584423) (← links)
• The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) (← links)
• Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
• Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
• On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs (Q2452398) (← links)
• Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
• The signed maximum-clique transversal number of regular graphs (Q4903571) (← links)