Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs
type: Item
instance of: scholarly article
title: Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs
author: John Engbers
author: Aysel Erey
published in: Graphs and Combinatorics
publication date: 2025-01-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7964494
zbMATH Keywords: Widom-Rowlinson coloring
zbMATH Keywords: chromatic number
zbMATH Keywords: connectivity
MaRDI profile type: Publication
cites work: Many \(T\) copies in \(H\)-free graphs
cites work: Graph homomorphisms and phase transitions
cites work: The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
cites work: On the Widom–Rowlinson Occupancy Fraction in Regular Graphs
cites work: Graph homomorphisms between trees
cites work: Sidorenko's conjecture, colorings and independent sets
cites work: Extremal graphs for homomorphisms
cites work: Extremal H‐Colorings of Graphs with Fixed Minimum Degree
cites work: Extremal colorings and independent sets
cites work: Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
cites work: Extremal \(H\)-colorings of trees and 2-connected graphs
cites work: Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
cites work: A proof of Tomescu's graph coloring conjecture
cites work: Maximizing H‐Colorings of a Regular Graph
cites work: Proof of London's conjecture on sums of elements of positive matrices
cites work: Q5628155
cites work: On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
DOI: 10.1007/S00373-024-02869-3
description: scientific article; zbMATH DE number 7964494