Pages that link to "Item:Q1932477"
From MaRDI portal
The following pages link to Decomposition of even-hole-free graphs with star cutsets and 2-joins (Q1932477):
Displaying 19 items.
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← links)
- Even-hole-free graphs. I: Decomposition theorem (Q2778281) (← links)
- (Q5743476) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs (Q6057651) (← links)
- Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816) (← links)
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs (Q6106299) (← links)
- Graphs with all holes the same length (Q6564607) (← links)
- Graphs with no even holes and no sector wheels are the union of two chordal graphs (Q6612305) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
