Extremal colorings and independent sets
type: Item
instance of: scholarly article
title: Extremal colorings and independent sets
zbMATH Open document ID: 1402.05064
author: John Engbers
author: Aysel Erey
published in: Graphs and Combinatorics
publication date: 2019-01-11T00:00:00Z
full work available at URL: https://epublications.marquette.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7000694
zbMATH Keywords: extremal graph
zbMATH Keywords: coloring
zbMATH Keywords: independent set
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
OpenAlex ID: W2892791622
cites work: Independent sets in graphs with given minimum degree
cites work: New bounds for chromatic polynomials and chromatic roots
cites work: The strong perfect graph theorem
cites work: Extremal problems for independent set enumeration
cites work: Extremes of the internal energy of the Potts model on cubic graphs
cites work: Q5313291
cites work: Extremal H‐Colorings of Graphs with Fixed Minimum Degree
cites work: Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
cites work: Extremal \(H\)-colorings of trees and 2-connected graphs
cites work: On the maximum number of colorings of a graph
cites work: Maximizing the number of \(x\)-colorings of 4-chromatic graphs
cites work: Minimum degree and disjoint cycles in claw-free graphs
cites work: A proof of Tomescu's graph coloring conjecture
cites work: Maximizing H‐Colorings of a Regular Graph
cites work: Counting colorings of a regular graph
cites work: On weighted graph homomorphisms
cites work: Maximising ‐colourings of graphs
cites work: Maximum number of colourings: 4-chromatic graphs
cites work: Maximum number of colourings: 5-chromatic case
cites work: On the coefficients of the independence polynomial of graphs
cites work: Maximizing the number of q -colorings
cites work: Maximizing proper colorings on graphs
cites work: Q3931424
cites work: Q5628155
cites work: Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
cites work: Maximal chromatic polynomials of connected planar graphs
cites work: On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
cites work: Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
Wikidata QID: Q129192318
DOI: 10.1007/S00373-018-1951-3
description: scientific article; zbMATH DE number 7000694