Pages that link to "Item:Q5325947"
From MaRDI portal
The following pages link to A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947):
Displayed 8 items.
- A set and collection lemma (Q405128) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- (Q5061398) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)