Pages that link to "Item:Q287036"
From MaRDI portal
The following pages link to A generalization of chordal graphs and the maximum clique problem (Q287036):
Displaying 11 items.
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- Root bundles and towards exact matter spectra of F-theory MSSMs (Q2237613) (← links)
- Linear degree extractors and the inapproximability of max clique and chromatic number (Q2931428) (← links)
- (Q3035321) (← links)
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem (Q3596359) (← links)
- (Q3607127) (← links)
- Optimal‐size clique transversals in chordal graphs (Q4646950) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)