Node-Deletion Problems on Bipartite Graphs

Cited in

(only showing first 100 items - show all)

The number of maximal dissociation sets in unicyclic graphs
An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
The k‐path vertex cover: General bounds and chordal graphs
Dissociation in circulant graphs and integer distance graphs
The iteration time and the general position number in graph convexities
Mutual d-visibility in graphs
The maximum number of maximum dissociation sets in trees
Maximum bipartite subgraphs of geometric intersection graphs
Partitioning a graph into small pieces with applications to path transversal
Edge-contraction problems
Maximum dissociation sets in subcubic trees
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
\(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
Linear structure of bipartite permutation graphs and the longest path problem
Between 2- and 3-colorability
On the weighted \(k\)-path vertex cover problem
On the hardness of energy minimisation for crystal structure prediction
Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
Minimum \(d\)-blockers and \(d\)-transversals in graphs
Computing the Minimum Fill-In is NP-Complete
A fixed-parameter algorithm for the vertex cover P₃ problem
Minimizing the influence spread over a network through node interception
Tractability beyond -acyclicity for conjunctive queries with negation and SAT
Maximum weight t-sparse set problem on vector-weighted graphs
An efficient algorithm for minimum feedback vertex sets in rotator graphs
Treewidth versus clique number. II: Tree-independence number
Analyzing the 3-path vertex cover problem in selected graph classes
On computing the minimum 3-path vertex cover and dissociation number of graphs
Implications of forbidden structures for extremal algorithmic problems
Independent packings in structured graphs
Connected matchings in chordal bipartite graphs
Circular convex bipartite graphs: feedback vertex set
A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs
Augmenting approach for some maximum set problems
Edge deletion problems: branching facilitated by modular decomposition
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
The \(k\)-path vertex cover of rooted product graphs
Improved approximation algorithms for path vertex covers in regular graphs
Blockers and transversals
On spectral extrema of graphs with given order and generalized 4-independence number
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Enumerating maximal dissociation sets in three classes of grid graphs
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
On the complexity of the k-chain subgraph cover problem
Recognizing interval digraphs and interval bigraphs in polynomial time
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
Parameterized algorithms for finding highly connected solution
New upper bounds on feedback vertex numbers in butterflies
3-path vertex cover and dissociation number of hexagonal graphs
The complexity of dissociation set problems in graphs
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
Extracting embedded generalized networks from linear programming problems
Bandwidth of chain graphs
Circular convex bipartite graphs: feedback vertex sets
The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
Chordless Cycle Packing Is Fixed-Parameter Tractable
Feedback vertex sets on restricted bipartite graphs
Some new considerations about double nested graphs
A probabilistic estimator for the vertex deletion problem
A bound on the dissociation number
Approximating bounded degree deletion via matroid matching
On minimum t-claw deletion in split graphs
Some results on graphs without long induced paths
The weighted k-path vertex cover problem on series-parallel graphs
Parameterized complexity of deletion to scattered graph classes
Vertex deletion problems on chordal graphs
Acyclic matchings in subclasses of bipartite graphs
Graph classes with structured neighborhoods and algorithmic applications
The chain graph sandwich problem
Maximal and maximum dissociation sets in general and triangle-free graphs
On computing longest paths in small graph classes
The maximum number of maximum generalized 4-independent sets in trees
Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
Conjunctive-query containment and constraint satisfaction
Approximating partially bounded degree deletion on directed graphs
Solving matching problems efficiently in bipartite graphs
The geodesic-transversal problem
On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Biclique graphs and biclique matrices
The maximum k-colorable subgraph problem for chordal graphs
Secure total domination in chain graphs and cographs
On the Harary Index of Graphs with Given Dissociation Number
Extremal vertex-degree function index with given order and dissociation number
On spectral extrema of graphs with given order and dissociation number
On edge perfectness and classes of bipartite graphs
A good submatrix is hard to find
Maximum generalized 4-independent sets in subcubic trees
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
Matching interdiction
Minimum \(k\)-path vertex cover
Subset feedback vertex set on graphs of bounded independent set size
Minimum fill-in: inapproximability and almost tight lower bounds
Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
Subset feedback vertex set on graphs of bounded independent set size
On the vertex \(k\)-path cover
A note on the second-largest number of dissociation sets in connected graphs

This page was built for publication: Node-Deletion Problems on Bipartite Graphs

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