Pages that link to "Item:Q2498407"
From MaRDI portal
The following pages link to Error compensation in leaf power problems (Q2498407):
Displayed 23 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- The complete inclusion structure of leaf power classes (Q1040592) (← links)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
- Maximal determinants of combinatorial matrices (Q1641998) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- On graphs with 2 trivial distance ideals (Q2174093) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- (Q5089163) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)