Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets

DOI10.1007/978-3-031-49611-0_6MaRDI QIDQ6606167

Raquel S. F. Bravo, Uéverton S. Souza, Rodolfo A. Oliveira, Maria Luíza L. da Cruz

Publication date: 16 September 2024

zbMATH Keywords

stable setnear-bipartiteindependent feedback vertex setdominating edgeacyclic vertex cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new characterization of \(P_k\)-free graphs
• On 1-improper 2-coloring of sparse graphs
• On parameterized independent feedback vertex set
• Dominating cliques in \(P_ 5\)-free graphs
• The complexity of some problems related to GRAPH 3-COLORABILITY
• The complexity of \(G\)-free colourability
• Independent feedback vertex sets for graphs of bounded diameter
• Independent feedback vertex set for \(P_5\)-free graphs
• Cycle transversals in perfect graphs and cographs
• Degree-constrained 2-partitions of graphs
• Partition the vertices of a graph into one independent set and one acyclic set
• Decycling with a matching
• Defective coloring revisited
• Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
• Reducibility among Combinatorial Problems
• Recognizing Graphs Close to Bipartite Graphs
• The complexity of satisfiability problems
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• An improved FPT algorithm for independent feedback vertex set
• Partitioning \(P_4\)-tidy graphs into a stable set and a forest

This page was built for publication: Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets

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