Characterization for the chromaticity of a class of the dense graphs

DOI10.3969/J.ISSN.1673-3193.2011.03.003MaRDI QIDQ2917795zbMATH OpenFDO

Authors Fuqin Zhan, Youfu Qiao, Meijin Luo

Publication date 5 October 2012

Published in Journal of North University of China. Natural Science Edition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.1673-3193.2011.03.003

zbMATH Keywords

adjoint equivalentadjoint polynomialadjoint uniquenesschromatically equivalentchromatically uniquenessminimum root

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• Chromaticity of some families of dense graphs
• Chromaticity of the complements of D_n
• scientific article; zbMATH DE number 2108155
• The factorization theorem of adjoint polynomials of graphs with application
• The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement

Cited in

(2)

• Dense uniform hypergraphs have high list chromatic number
• Density of Chromatic Roots in Minor-Closed Graph Families

This page was built for publication: Characterization for the chromaticity of a class of the dense graphs

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