Pages that link to "Item:Q2565689"
From MaRDI portal
The following pages link to Local chromatic number and Sperner capacity (Q2565689):
Displayed 15 items.
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Coloring chains for compression with uncertain priors (Q668010) (← links)
- On colorings of graph powers (Q1043947) (← links)
- A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
- Connectivity of strong products of graphs (Q1959713) (← links)
- Partitioning transitive tournaments into isomorphic digraphs (Q2035088) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- Intervals and convex sets in strong product of graphs (Q2376077) (← links)
- Edge-colorings of 4-regular graphs with the minimum number of palettes (Q2631073) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
- A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958) (← links)
- Relations between the Local Chromatic Number and Its Directed Version (Q5265337) (← links)
- Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)
- Colorings of complements of line graphs (Q6056781) (← links)