The following pages link to Irredundancy in circular arc graphs (Q686248):
Displaying 50 items.
- A lower bound for the CO-irredundance number of a graph (Q556836) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Upper domination and upper irredundance perfect graphs (Q1584381) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- On maximum induced matchings in bipartite graphs (Q1847371) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- New results on induced matchings (Q1975379) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Weighted irredundance of interval graphs. (Q2583539) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Irredundance (Q3384112) (← links)
- The Private Neighbor Concept (Q3384113) (← links)
- Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- (Q4691867) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Some bounds on the maximum induced matching numbers of certain grids (Q5383192) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
- (Q5869351) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
