Pages that link to "Item:Q3967551"
From MaRDI portal
The following pages link to Transformations which Preserve Perfectness and H-Perfectness of Graphs (Q3967551):
Displaying 33 items.
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- A class of h-perfect graphs (Q799701) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- Locally perfect graphs (Q1105623) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- Quasi-parity and perfect graphs (Q1349738) (← links)
- Path parity and perfection (Q1356748) (← links)
- On planar perfectly contractile graphs (Q1359374) (← links)
- About skew partitions in minimal imperfect graphs (Q1850559) (← links)
- A transformation which preserves the clique number (Q1850572) (← links)
- No odd pairs in minimal imperfect NP\({}_{5}\) graphs. (Q1853069) (← links)
- On dart-free perfectly contractile graphs (Q1885896) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- Characterising claw-free t-perfect graphs (Q2851509) (← links)
- K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
