Extremal colorings and independent sets

DOI10.1007/S00373-018-1951-3zbMATH Open1402.05064OpenAlexW2892791622WikidataQ129192318 ScholiaQ129192318MaRDI QIDQ1756103FDOQ1756103

Authors: John Engbers, Aysel Erey 

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://epublications.marquette.edu/cgi/viewcontent.cgi?article=1011&context=math_fac

Recommendations

• On the maximum number of colorings of a graph
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• scientific article; zbMATH DE number 15467
• Maximum number of colourings: 4-chromatic graphs

zbMATH Keywords

chromatic numberindependent setcoloringextremal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• The strong perfect graph theorem
• Maximizing the number of q -colorings
• On weighted graph homomorphisms
• Maximizing proper colorings on graphs
• Independent sets in graphs with given minimum degree
• Extremal problems for independent set enumeration
• Extremal \(H\)-colorings of trees and 2-connected graphs
• Title not available (Why is that?)
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• Minimum degree and disjoint cycles in claw-free graphs
• On the maximum number of colorings of a graph
• On the coefficients of the independence polynomial of graphs
• On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
• Counting colorings of a regular graph
• Maximizing \(H\)-colorings of a regular graph
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• Maximum number of colourings: 5-chromatic case
• New bounds for chromatic polynomials and chromatic roots
• A proof of Tomescu's graph coloring conjecture
• Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
• Maximal chromatic polynomials of connected planar graphs
• Title not available (Why is that?)
• Maximum number of colourings: 4-chromatic graphs
• Extremal regular graphs: independent sets and graph homomorphisms
• Extremes of the internal energy of the Potts model on cubic graphs
• Maximising \(H\)-colourings of graphs

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
• On the maximum number of colorings of a graph
• Independence number and maximal chromatic polynomials of connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
• Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number

This page was built for publication: Extremal colorings and independent sets

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