A Bound for the Chromatic Number of a Graph
From MaRDI portal
Publication:4083459
DOI10.2307/2318218zbMath0322.05112OpenAlexW4241243276MaRDI QIDQ4083459
Publication date: 1976
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2318218
Related Items
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank, Some relations among term rank, clique number and list chromatic number of a graph, On rank vs. communication complexity, Around the log-rank conjecture, On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph, On order and rank of graphs, Matrix rank and communication complexity, Rank, term rank and chromatic number of a graph, On set intersection representations of graphs, An Additive Combinatorics Approach Relating Rank to Communication Complexity, Communication complexity and combinatorial lattice theory