Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

DOI10.1002/JGT.22105zbMath1368.05049arXiv1601.05040OpenAlexW2963327175MaRDI QIDQ4978445

John Engbers

Publication date: 10 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.05040

zbMATH Keywords

graph homomorphismminimum degree\(H\)-coloring\(k\)-connected graphproper coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Extremal \(H\)-colorings of trees and 2-connected graphs ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Extremal colorings and independent sets ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs

Cites Work

• Extremal \(H\)-colorings of trees and 2-connected graphs
• Graph homomorphisms between trees
• A partially ordered set of functionals corresponding to graphs
• The maximum number of complete subgraphs in a graph with given maximum degree
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Bipartite Swapping Trick on Graph Homomorphisms
• The Number of Independent Sets in a Regular Graph
• On weighted graph homomorphisms
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree

This page was built for publication: Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree