Pages that link to "Item:Q5470779"
From MaRDI portal
The following pages link to Algorithms for Perfectly Contractile Graphs (Q5470779):
Displayed 18 items.
- Even pairs in square-free Berge graphs (Q322216) (← links)
- CIO and ring graphs: deficiency and testing (Q507135) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- The three-in-a-tree problem (Q653792) (← links)
- Finding induced trees (Q967418) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Even pairs and prism corners in square-free Berge graphs (Q1748264) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Detecting a long even hole (Q2143407) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs (Q4632025) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- (Q5743476) (← links)
- Detecting induced subgraphs (Q5900072) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)