scientific article

zbMath0641.05029MaRDI QIDQ3781778

Marietjie Frick, Izak Broere

Publication date: 1985

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

zbMATH Keywords

(k,xm)-critical graphsm-admissible coloringm-th chromatic number

Mathematics Subject Classification ID

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

Related Items (3)

Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ On the order of uniquely (k,m)-colourable graphs ⋮ Relaxed chromatic numbers of graphs

This page was built for publication: