Clique cycle transversals in graphs with few P₄'s

MaRDI QIDQ5747404zbMATH OpenFDO

Authors Raquel S. F. Bravo, Sulamita Klein, Fábio Protti, Loana T. Nogueira

Publication date 14 February 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2309/0.html

zbMATH Keywords

cliquecycle transversalextended \(P_4\)-laden graphfeedback vertex set

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Clique cycle-transversals in distance-hereditary graphs
• Cycle transversals in perfect graphs and cographs
• On clique-transversals and clique-independent sets
• The clique-transversal set problem in claw-free graphs with degree at most 4
• Partitioning extended \(P_4\)-laden graphs into cliques and stable sets

Cited in

(5)

• Cycle transversals in perfect graphs and cographs
• Perfect matching cuts partitioning a graph into complementary subgraphs
• Clique cycle-transversals in distance-hereditary graphs
• Clique-transversal sets in 4-regular claw-free graphs
• Perfect matching cuts partitioning a graph into complementary subgraphs

This page was built for publication: Clique cycle transversals in graphs with few \(P_{4}\)'s

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747404)