Pages that link to "Item:Q2492201"
From MaRDI portal
The following pages link to On the interval completion of chordal graphs (Q2492201):
Displaying 11 items.
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- Completion of the Mixed Unit Interval Graphs Hierarchy (Q2948474) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- (Q3405197) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (Q4268849) (← links)
- (Q5490487) (← links)
- On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)