The following pages link to Decycling with a matching (Q2628271):
Displaying 4 items.
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)