Abstract: We study two weighted graph coloring problems, in which one assigns colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting that either disfavors or favors a given color. We exhibit a weighted chromatic polynomial associated with this problem that generalizes the chromatic polynomial . General properties of this polynomial are proved, and illustrative calculations for various families of graphs are presented. We show that the weighted chromatic polynomial is able to distinguish between certain graphs that yield the same chromatic polynomial. We give a general structural formula for for lattice strip graphs with periodic longitudinal boundary conditions. The zeros of in the and planes and their accumulation sets in the limit of infinitely many vertices of are analyzed. Finally, some related weighted graph coloring problems are mentioned.
Recommendations
- Weighted-set graph colorings
- A weighted graph polynomial from chromatic invariants of knots
- Exact results on Potts model partition functions in a generalized external field and weighted-set graph colorings
- scientific article; zbMATH DE number 6004918
- Weighted coloring: further complexity and approximability results
Cites work
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 4091530 (Why is no real title available?)
- scientific article; zbMATH DE number 50597 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 503283 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3007985 (Why is no real title available?)
- scientific article; zbMATH DE number 3440450 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- An introduction to chromatic polynomials
- Boundary chromatic polynomial
- Exactly solved models: A journey in statistical mechanics. Selected papers with commentaries (1963-2008).
- Ground state entropy of the Potts antiferromagnet on strips of the square lattice
- Potts model partition functions for self-dual families of strip graphs
- Some exact results on the Potts model partition function in a magnetic field
- Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
- The partition function zeros in the one-dimensional q-state Potts model
- Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups
Cited in
(14)- Enumeration and structure of inhomogeneous graphs
- Edge Coloring and Decompositions of Weighted Graphs
- Totally frustrated states in the chromatic theory of gain graphs
- Edge weights and vertex colours
- Exact results on Potts model partition functions in a generalized external field and weighted-set graph colorings
- scientific article; zbMATH DE number 4144006 (Why is no real title available?)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- Weighted-set graph colorings
- Exact partition functions for the q-state Potts model with a generalized magnetic field on lattice strip graphs
- Measures of spin ordering in the Potts model with a generalized external magnetic field
- scientific article; zbMATH DE number 6004918 (Why is no real title available?)
- Some exact results on bond percolation
- On the Potts model partition function in an external field
- Weighted Improper Colouring
This page was built for publication: Weighted graph colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963274)