TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS

DOI10.1080/16073606.1990.9631611zbMATH Open0707.05026OpenAlexW2048293829MaRDI QIDQ3487367FDOQ3487367

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

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

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• Multiple vertex coverings by cliques
• Two remarks on the coloring number
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Twin-width and generalized coloring numbers
• Bounded \(VC\)-dimension implies the Schur-Erdős conjecture

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)