The following pages link to Path parity and perfection (Q1356748):
Displaying 17 items.
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- Algorithms for maximum weight induced paths (Q1603504) (← links)
- On dart-free perfectly contractile graphs (Q1885896) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- On the complexity of finding even pairs in planar perfect graphs (Q2741504) (← links)
- Even pairs (Q2758333) (← links)
- Perfectly contractile diamond-free graphs (Q4719326) (← links)
- (Q5743428) (← links)
- Paths are Turán-good (Q6045138) (← links)
- (Q6065419) (← links)
- Perfectly contractile graphs and quadratic toric rings (Q6096783) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)