Pages that link to "Item:Q1762983"
From MaRDI portal
The following pages link to Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size (Q1762983):
Displaying 16 items.
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
- (Q5869351) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Computational complexity aspects of super domination (Q6076353) (← 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)