The clique-transversal set problem in \claw,K₄\-free planar graphs
DOI10.1016/J.IPL.2016.10.001zbMATH Open1391.05245OpenAlexW2533036208MaRDI QIDQ344543FDOQ344543
Authors: Zuosong Liang, Erfang Shan, Liying Kang 
Publication date: 23 November 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.10.001
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)
Cites Work
- Graph theory
- Covering all cliques of a graph
- Bounds on the clique-transversal number of regular graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Distance-hereditary graphs are clique-perfect
- On balanced graphs
- Covering the cliques of a graph with vertices
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Clique-transversal sets and clique-coloring in planar graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- The clique-transversal set problem in claw-free graphs with degree at most 4
- Algorithmic Aspects of Neighborhood Numbers
- Clique-transversal sets of line graphs and complements of line graphs
- Algorithms for finding clique-transversals of graphs
Cited In (6)
- Title not available (Why is that?)
- Clique-transversal sets in 4-regular claw-free graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Clique-perfectness of claw-free planar graphs
- The clique-transversal set problem in claw-free graphs with degree at most 4
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
This page was built for publication: The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344543)
