The following pages link to Irredundancy in circular arc graphs (Q686248):
Displaying 6 items.
- (Q5869351) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- A bisection approach to subcubic maximum induced matching (Q6575400) (← links)
- An improved kernel and parameterized algorithm for almost induced matching (Q6636070) (← links)
- Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)
- Well-indumatched pseudoforests (Q6657223) (← links)