scientific article

zbMath0536.05023MaRDI QIDQ3320406

N. N. Mozhan

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

degreecomplete graphsBrooks' Theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A note on \(\Delta\)-critical graphs ⋮ Large cliques in graphs with high chromatic number ⋮ The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree ⋮ Graphs with chromatic number close to maximum degree ⋮ Partitioning of a graph into induced subgraphs not containing prescribed cliques ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ \(\Delta \)-critical graphs with small high vertex cliques

This page was built for publication: