Pages that link to "Item:Q2347846"
From MaRDI portal
The following pages link to A faster algorithm to recognize even-hole-free graphs (Q2347846):
Displaying 13 items.
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← 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)
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← 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)
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
