The clique-transversal set problem in \claw,K₄\-free planar graphs

DOI10.1016/J.IPL.2016.10.001MaRDI QIDQ344543zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsgraph algorithmscombinatorial problems

Mathematics Subject Classification ID

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)

Recommendations

• The clique-transversal set problem in claw-free graphs with degree at most 4
• The bound of clique-transversal numbers in claw-free graphs
• Clique-transversal sets and clique-coloring in planar graphs
• scientific article; zbMATH DE number 2044919
• Clique-perfectness of claw-free planar graphs

Cites work

• Algorithmic Aspects of Neighborhood Numbers
• Algorithmic aspects of clique-transversal and clique-independent sets
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• Algorithms for finding clique-transversals of graphs
• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
• Bounds on the clique-transversal number of regular graphs
• Clique-transversal sets and clique-coloring in planar graphs
• Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
• Clique-transversal sets of line graphs and complements of line graphs
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• Distance-hereditary graphs are clique-perfect
• Graph theory
• On balanced graphs
• On clique-transversals and clique-independent sets
• On covering all cliques of a chordal graph
• The clique-transversal set problem in claw-free graphs with degree at most 4

Cited in

(6)

• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
• Clique-transversal sets in 4-regular claw-free graphs
• scientific article; zbMATH DE number 2044919 (Why is no real title available?)
• 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

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)