Pages that link to "Item:Q3921261"
From MaRDI portal
The following pages link to Node-Deletion Problems on Bipartite Graphs (Q3921261):
Displayed 41 items.
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- Matching interdiction (Q602686) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Two characterizations of chain partitioned probe graphs (Q646714) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Edge-contraction problems (Q794164) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Blockers and transversals (Q1043948) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- A probabilistic estimator for the vertex deletion problem (Q1130419) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- A good submatrix is hard to find (Q1836717) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- Approximation Algorithms for Minimum Chain Vertex Deletion (Q3078376) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Extracting embedded generalized networks from linear programming problems (Q3693261) (← links)
- Computing the Minimum Fill-In is NP-Complete (Q3960122) (← links)
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)
- Biclique graphs and biclique matrices (Q5189236) (← links)
- Between 2- and 3-colorability (Q5902303) (← links)