TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS

DOI10.1080/16073606.1990.9631611MaRDI QIDQ3487367zbMATH OpenOpenAlexFDO

Authors Izak Broere, Marietjie Frick

Publication date 1990

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/16073606.1990.9631611

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 867685
• scientific article; zbMATH DE number 4043873
• scientific article; zbMATH DE number 2157285
• On the order of uniquely (k,m)-colourable graphs
• Generalizations of independence and chromatic numbers of a graph

Cited in

(10)

• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• Two remarks on the coloring number
• scientific article; zbMATH DE number 845484 (Why is no real title available?)
• scientific article; zbMATH DE number 4051672 (Why is no real title available?)
• scientific article; zbMATH DE number 3468845 (Why is no real title available?)
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Bounded \(VC\)-dimension implies the Schur-Erdős conjecture
• Multiple vertex coverings by cliques
• Twin-width and generalized coloring numbers
• scientific article; zbMATH DE number 4043873 (Why is no real title available?)

This page was built for publication: TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS

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