Pages that link to "Item:Q3067059"
From MaRDI portal
The following pages link to On hitting all maximum cliques with an independent set (Q3067059):
Displaying 17 items.
- A set and collection lemma (Q405128) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- A structural approach for independent domination of regular graphs (Q497353) (← links)
- On the independent domination number of regular graphs (Q1929752) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- A different short proof of Brooks' theorem (Q2509552) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs (Q6071822) (← links)
- Special issue in honour of Landon Rabern (Q6091821) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
- Hitting all maximum stable sets in \(P_5\)-free graphs (Q6187345) (← links)
