Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
DOI10.1142/S1793830911001243zbMATH Open1242.05261OpenAlexW2057789585MaRDI QIDQ2890989FDOQ2890989
Authors: Fanica Gavril 
Publication date: 12 June 2012
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830911001243
Recommendations
polygon-circle graphcircle graphmaximum induced forestminimum feedback vertex setcircle trapezoid graph
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- The Complexity of Coloring Circular Arcs and Chords
- Title not available (Why is that?)
- The maximum k-colorable subgraph problem for chordal graphs
- Thresholds for classes of intersection graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Trapezoid graphs and generalizations, geometry and algorithms
- Title not available (Why is that?)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Minimum weight feedback vertex sets in circle graphs
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- Feedback vertex set on AT-free graphs
- 3D-interval-filament graphs
- Feedback vertex set on cocomparability graphs
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)
