scientific article; zbMATH DE number 927067

DOI10.1002/(SICI)1097-0118(199609)23:1%3C33::AID-JGT3%3E3.0.CO;2-LMaRDI QIDQ4892340zbMATH OpenFDO

Authors Xuding Zhu

Publication date 22 June 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199609)23:1%3C33::AID-JGT3%3E3.0.CO;2-L

zbMATH Keywords

corehomomorphismstar-chromatic numberuniquely \(H\)-colorablevertex-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• Uniquely D-colourable digraphs with large girth
• A note on uniquely H-colorable graphs
• scientific article; zbMATH DE number 1309148
• Uniquely circular colourable and uniquely fractional colourable graphs of large girth
• The size of uniquely colorable graphs
• The existence of uniquely \(-G\) colourable graphs
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• ON UNIQUELY -G k-COLOURABLE GRAPHS

Cited in

(29)

• The good, the bad, and the great: homomorphisms and cores of random graphs
• Circular chromatic numbers of Mycielski's graphs
• Homomorphisms and amalgamation
• On sparse graphs with given colorings and homomorphisms.
• Circular chromatic indices of even degree regular graphs
• Cuts and bounds
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• An analogue of Hajós' theorem for the circular chromatic number
• Uniquely D-colourable digraphs with large girth
• Triangle-free subgraphs with large fractional chromatic number
• scientific article; zbMATH DE number 4012642 (Why is no real title available?)
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• scientific article; zbMATH DE number 1309148 (Why is no real title available?)
• scientific article; zbMATH DE number 1420226 (Why is no real title available?)
• The circular chromatic number of series-parallel graphs with large girth
• Subgraphs of Kneser graphs with large girth and large chromatic number
• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
• A note on uniquely H-colorable graphs
• Uniquely circular colourable and uniquely fractional colourable graphs of large girth
• Circular chromatic indices of regular graphs
• Triangle-free subgraphs with large fractional chromatic number
• Construction of sparse graphs with prescribed circular colorings
• Dualities and dual pairs in Heyting algebras
• Girth and λ \lambda ‐choosability of graphs
• On colouring oriented graphs of large girth
• Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
• Homomorphisms of (n,m)-graphs with respect to generalised switch
• Circular total chromatic numbers of graphs
• Unique graph homomorphisms onto odd cycles. II

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 Q4892340)