The following pages link to (Q4448767):
Displayed 9 items.
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- (Q5708527) (← links)