A Bound for the Chromatic Number of a Graph

DOI10.2307/2318218MaRDI QIDQ4083459zbMATHOpenAlexFDO

Authors Cyriel Van Nuffelen

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited in

(11)

• On set intersection representations of graphs
• On rank vs. communication complexity
• Around the log-rank conjecture
• On order and rank of graphs
• Communication complexity and combinatorial lattice theory
• Rank, term rank and chromatic number of a graph
• Some relations among term rank, clique number and list chromatic number of a graph
• Matrix rank and communication complexity
• An additive combinatorics approach relating rank to communication complexity
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph

This page was built for publication: A Bound for the Chromatic Number of a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083459)