- Home
- » Tags
- » Induced matching
Top View
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy⋆
- On Graphs Decomposable Into Induced Matchings of Linear Sizes
- Relaxations of the Weakly Chordal Condition in Graphs
- Induced Matchings in Asteroidal Triple-Free Graphs
- Induced Matchings in Subcubic Planar Graphs 1385
- Complete Dichotomy of Some Challenging Problems in Graph Theory✩ Celina M.H
- Degenerate Matchings and Edge Colorings Julien Baste, Dieter Rautenbach
- Strong Edge-Colouring and Induced Matchings Hervé Hocquard, Pascal Ochem, Petru Valicov
- On Some Hard and Some Tractable Cases of the Maximum Acyclic
- On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism Faisal N Abu-Khzam, Édouard Bonnet, Florian Sikora
- Matchings, Coverings, and Castelnuovo-Mumford Regularity 2
- On the Induced Matching Problem✩
- The Complexity of Dissociation Set Problems in Graphs
- Bidimensionality and EPTAS
- Strong Edge-Colouring and Induced Matchings Hervé Hocquard, Pascal Ochem, Petru Valicov
- Graph Colouring and the Probabilistic Method
- Bidimensionality and Parameterized Algorithms∗
- Strong Edge-Colouring and Induced Matchings Hervé Hocquard, Pascal Ochem, Petru Valicov