On the number of regular configurations

DOI10.1016/0012-365X(87)90118-XMaRDI QIDQ1106248zbMATH OpenFDO

Authors Yunshyong Chow

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(87)90118-X

zbMATH Keywords

coloringslargest eigenvaluelattice pointsregular configurations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Recommendations

• Counting colorings of a regular graph
• On the chromatic number of random \(d\)-regular graphs
• On the chromatic number of random regular graphs
• Matricial construction of k-colourings on square lattice.
• Colouring Random Regular Graphs

Cites work

• scientific article; zbMATH DE number 3856167 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3373676 (Why is no real title available?)
• On the number of regular configurations
• Some remarks on the ground state of infinite systems in statistical mechanics
• Three-Colorings of the Square Lattice: A Hard Squares Model

Cited in

(3)

• On the number of regular configurations
• Enumerating regular mixed-cell configurations
• scientific article; zbMATH DE number 3982964 (Why is no real title available?)

This page was built for publication: On the number of regular configurations

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