The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs

DOI10.1016/j.ipl.2016.10.001zbMath1391.05245OpenAlexW2533036208MaRDI QIDQ344543

Zuosong Liang, Erfang Shan, Li-ying 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

zbMATH Keywords

algorithmscombinatorial problemsgraph algorithms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• The clique-transversal set problem in claw-free graphs with degree at most 4
• Clique-transversal sets of line graphs and complements of line graphs
• Algorithms for finding clique-transversals of graphs
• Bounds on the clique-transversal number of regular graphs
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• On clique-transversals and clique-independent sets
• On covering all cliques of a chordal graph
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• 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
• Distance-hereditary graphs are clique-perfect
• On balanced graphs
• Algorithmic Aspects of Neighborhood Numbers

This page was built for publication: The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs