Extremal colorings and independent sets
From MaRDI portal
Publication:1756103
DOI10.1007/s00373-018-1951-3zbMath1402.05064OpenAlexW2892791622WikidataQ129192318 ScholiaQ129192318MaRDI QIDQ1756103
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
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal \(H\)-colorings of trees and 2-connected graphs
- Independent sets in graphs with given minimum degree
- Maximizing proper colorings on graphs
- Extremal problems for independent set enumeration
- Maximum number of colourings: 4-chromatic graphs
- The strong perfect graph theorem
- On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs
- On the maximum number of colorings of a graph
- On the coefficients of the independence polynomial of graphs
- Maximum number of colourings: 5-chromatic case
- Counting colorings of a regular graph
- 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)
- Minimum Degree and Disjoint Cycles in Claw-Free Graphs
- Maximizing the number of q -colorings
- Maximal chromatic polynomials of connected planar graphs
- Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
- On weighted graph homomorphisms
- Extremes of the internal energy of the Potts model on cubic graphs
- Maximizing H‐Colorings of a Regular Graph
- Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
- Maximising ‐colourings of graphs
- Extremal H‐Colorings of Graphs with Fixed Minimum Degree
This page was built for publication: Extremal colorings and independent sets
