Pages that link to "Item:Q1917257"
From MaRDI portal
The following pages link to A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257):
Displaying 6 items.
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
- Path parity and perfection (Q1356748) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- (Q5743428) (← links)
