Pages that link to "Item:Q870966"
From MaRDI portal
The following pages link to Triangulated neighborhoods in even-hole-free graphs (Q870966):
Displaying 17 items.
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Bisimplicial vertices in even-hole-free graphs (Q958679) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- Bounds on regularity of quadratic monomial ideals (Q2194763) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Forbidden induced subgraphs (Q2413330) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Perfectly contractile diamond-free graphs (Q4719326) (← links)
- (Q5743476) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816) (← links)
