Pages that link to "Item:Q2778281"

The following pages link to Even-hole-free graphs part I: Decomposition theorem (Q2778281):

Displaying 36 items.

• Graphs of separability at most 2 (Q415268) (← links)
• Complexity of independent set reconfigurability problems (Q441866) (← links)
• Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
• Stable sets and graphs with no even holes (Q745687) (← links)
• Induced packing of odd cycles in planar graphs (Q764360) (← links)
• Combinatorial optimization with 2-joins (Q765197) (← links)
• Triangulated neighborhoods in even-hole-free graphs (Q870966) (← 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)
• The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
• Square-free perfect graphs. (Q1426100) (← links)
• Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
• On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
• Detecting a long even hole (Q2143407) (← links)
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
• The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
• On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
• A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
• Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
• Detecting 2-joins faster (Q2376790) (← links)
• Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
• A polynomial recognition algorithm for balanced matrices (Q2565686) (← links)
• A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← links)
• Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
• Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
• Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
• Even-hole-free planar graphs have bounded treewidth (Q3503541) (← links)
• The Induced Disjoint Paths Problem (Q3503839) (← links)
• Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
• (Q5743476) (← links)
• Even-hole-free graphs still have bisimplicial vertices (Q6038593) (← 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)