Pages that link to "Item:Q3150171"

The following pages link to Even-hole-free graphs part II: Recognition algorithm (Q3150171):

Displaying 37 items.

• Complexity of independent set reconfigurability problems (Q441866) (← links)
• On the forbidden induced subgraph sandwich problem (Q643008) (← 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)
• Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
• On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
• The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
• Detecting a long even hole (Q2143407) (← links)
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
• On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
• Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← 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)
• One-three join: a graph operation and its consequences (Q2364085) (← links)
• Detecting 2-joins faster (Q2376790) (← links)
• Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← 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)
• Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
• The Induced Disjoint Paths Problem (Q3503839) (← links)
• On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
• Separation Choosability and Dense Bipartite Induced Subgraphs (Q5222550) (← 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)
• Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← 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)