Pages that link to "Item:Q1944214"
From MaRDI portal
The following pages link to Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214):
Displaying 6 items.
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
- The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)