Pages that link to "Item:Q1074595"

The following pages link to Coloring graphs with locally few colors (Q1074595):

Displaying 33 items.

• Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
• Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
• On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
• Induced colorful trees and paths in large chromatic graphs (Q504985) (← links)
• Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
• Coloring chains for compression with uncertain priors (Q668010) (← links)
• Coloring vertices and faces of locally planar graphs (Q855294) (← links)
• Local coloring of Kneser graphs (Q998322) (← links)
• On colorings of graph powers (Q1043947) (← links)
• A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
• Local \(k\)-colorings of graphs and hypergraphs (Q1095156) (← links)
• On locally-perfect colorings (Q1121900) (← links)
• Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
• NP-completeness of local colorings of graphs (Q1679905) (← links)
• Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
• On the extremal combinatorics of the Hamming space (Q1894014) (← links)
• Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
• The chromatic discrepancy of graphs (Q2341751) (← links)
• Local chromatic number of quadrangulations of surfaces (Q2439834) (← links)
• Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
• Local chromatic number and Sperner capacity (Q2565689) (← 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)
• NP for Combinatorialists (Q3503495) (← links)
• Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
• (Q4811984) (← links)
• Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
• Relations between the Local Chromatic Number and Its Directed Version (Q5265337) (← links)
• Colorings of complements of line graphs (Q6056781) (← links)
• Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
• Local orthogonality dimension (Q6094036) (← links)
• On locally identifying coloring of graphs (Q6132530) (← links)
• Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths (Q6642519) (← links)