Pages that link to "Item:Q5891021"

The following pages link to Maximal Induced Matchings in Triangle-Free Graphs (Q5891021):

Displaying 10 items.

• Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
• Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
• Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• (Q5005188) (← links)
• Maximal Induced Matchings in Triangle-Free Graphs (Q5891021) (← links)
• (Q5892156) (redirect page) (← 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)
• Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs (Q6633556) (← links)