Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
From MaRDI portal
Publication:2890989
Recommendations
Cites work
- scientific article; zbMATH DE number 3566474 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- 3D-interval-filament graphs
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Feedback vertex set on AT-free graphs
- Feedback vertex set on cocomparability graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Minimum weight feedback vertex sets in circle graphs
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- The Complexity of Coloring Circular Arcs and Chords
- The maximum k-colorable subgraph problem for chordal graphs
- Thresholds for classes of intersection graphs
- Trapezoid graphs and generalizations, geometry and algorithms
Cited in
(2)
This page was built for publication: Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890989)