The following pages link to Hoàng-Oanh Le (Q814930):
Displaying 28 items.
- New graph classes of bounded clique-width (Q814931) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs (Q1603536) (← links)
- (Q1740695) (redirect page) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Clique-width for 4-vertex forbidden subgraphs (Q2432547) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
- Optimal tree 3-spanners in directed path graphs (Q4267388) (← links)
- (Q4414485) (← links)
- (Q4425951) (← links)
- Additive Tree Spanners (Q4443141) (← links)
- (Q4636534) (← links)
- (Q5092371) (← links)
- Fundamentals of Computation Theory (Q5492927) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902514) (← links)
- Matching cut in graphs with large minimum degree (Q5919446) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
- Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles (Q6511010) (← links)
- Complexity of the cluster vertex deletion problem on \(H\)-free graphs (Q6584072) (← links)
