The following pages link to A theorem of Truemper (Q1586353):
Displaying 13 items.
- Graphs of separability at most 2 (Q415268) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- A Dini-Dax theorem (Q1325248) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Balanced matrices (Q2433704) (← links)
- Recognizing balanceable matrices (Q2583120) (← links)
- A conductor theorem (Q2716446) (← links)
- Even-hole-free graphs. I: Decomposition theorem (Q2778281) (← links)
- The world of hereditary graph classes viewed through Truemper configurations (Q2875860) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- A silting theorem (Q5964104) (← links)