Pages that link to "Item:Q3921261"
From MaRDI portal
The following pages link to Node-Deletion Problems on Bipartite Graphs (Q3921261):
Displayed 34 items.
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- On the Hardness of Energy Minimisation for Crystal Structure Prediction* (Q5862342) (← links)
- 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- (Q5874544) (← links)
- Between 2- and 3-colorability (Q5902303) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Parameterized algorithms for finding highly connected solution (Q5918560) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
- Parameterized algorithms for finding highly connected solution (Q5970787) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- (Q6089665) (← links)
- Certifying induced subgraphs in large graphs (Q6091166) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Maximum dissociation sets in subcubic trees (Q6176408) (← links)
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
- On the Harary Index of Graphs with Given Dissociation Number (Q6182443) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- Extremal vertex-degree function index with given order and dissociation number (Q6184319) (← links)
- On spectral extrema of graphs with given order and dissociation number (Q6184344) (← links)
- Minimum number of maximal dissociation sets in trees (Q6193972) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)