Pages that link to "Item:Q2427516"
From MaRDI portal
The following pages link to Chordal bipartite completion of colored graphs (Q2427516):
Displaying 15 items.
- Graph modification problem for some classes of graphs (Q350726) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- Completing Colored Graphs to Meet a Target Property (Q2864301) (← links)
- (Q5244020) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)