Extremal colorings and independent sets

DOI10.1007/S00373-018-1951-3MaRDI QIDQ1756103zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• scientific article; zbMATH DE number 3353319 (Why is no real title available?)
• A proof of Tomescu's graph coloring conjecture
• Counting colorings of a regular graph
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• Extremal \(H\)-colorings of trees and 2-connected graphs
• Extremal problems for independent set enumeration
• Extremal regular graphs: independent sets and graph homomorphisms
• Extremes of the internal energy of the Potts model on cubic graphs
• Independent sets in graphs with given minimum degree
• 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
• Maximising \(H\)-colourings of graphs
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• Maximizing \(H\)-colorings of a regular graph
• Maximizing proper colorings on graphs
• Maximizing the number of q -colorings
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• Maximum number of colourings: 4-chromatic graphs
• Maximum number of colourings: 5-chromatic case
• Minimum degree and disjoint cycles in claw-free graphs
• New bounds for chromatic polynomials and chromatic roots
• On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
• On the coefficients of the independence polynomial of graphs
• On the maximum number of colorings of a graph
• On weighted graph homomorphisms
• The strong perfect graph theorem

Cited in

(12)

• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• scientific article; zbMATH DE number 15467 (Why is no real title available?)
• On the maximum number of colorings of a graph
• scientific article; zbMATH DE number 1830756 (Why is no real title available?)
• Independence number and maximal chromatic polynomials of connected graphs
• scientific article; zbMATH DE number 4014750 (Why is no real title available?)
• Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
• scientific article; zbMATH DE number 3966126 (Why is no real title available?)
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
• scientific article; zbMATH DE number 2237565 (Why is no real title available?)
• Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs

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)