Pages that link to "Item:Q1321990"
From MaRDI portal
The following pages link to Stable set bonding in perfect graphs and parity graphs (Q1321990):
Displaying 17 items.
- A class of h-perfect graphs (Q799701) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- Polyhedral consequences of the amalgam operation (Q1331977) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- The stable set polytope and some operations on graphs (Q1613491) (← links)
- Minimal antichains in well-founded quasi-orders with an application to tournaments (Q1850501) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- Bisplit graphs (Q2568470) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS (Q4366150) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)