Pages that link to "Item:Q4209266"
From MaRDI portal
The following pages link to Minimum Fill-in on Circle and Circular-Arc Graphs (Q4209266):
Displaying 18 items.
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Leaf sector covers with applications on circle graphs (Q6549679) (← links)
