scientific article; zbMATH DE number 1309148

DOI10.1002/(SICI)1097-0118(199901)30:1%3C1::AID-JGT1%3E3.0.CO;2-PMaRDI QIDQ4256101zbMATH OpenFDO

Authors Xuding Zhu

Publication date 7 June 2000

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199901)30:1%3C1::AID-JGT1%3E3.0.CO;2-P

zbMATH Keywords

categorical productchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 927067
• A note on uniquely H-colorable graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS

Cited in

(15)

• The good, the bad, and the great: homomorphisms and cores of random graphs
• Circular chromatic numbers of Mycielski's graphs
• Planar graphs with circular chromatic numbers between 3 and 4
• Homomorphisms and amalgamation
• On sparse graphs with given colorings and homomorphisms.
• A blow-up construction and graph coloring
• Strongly Projective Graphs
• Constructions of 3-Colorable Cores
• scientific article; zbMATH DE number 927067 (Why is no real title available?)
• The circular chromatic number of series-parallel graphs with large girth
• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
• Uniquely colorable Cayley graphs
• A note on uniquely H-colorable graphs
• Construction of uniquely vertex k-colorable graphs with minimum possible size
• Making an H H‐free graph k k‐colorable

This page was built for publication:

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