Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New bounds for chromatic polynomials and chromatic roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic roots of generalized theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal \(H\)-colorings of trees and 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of colorings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthening of the Kuratowski planarity criterion for 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of <i>q</i> -colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing proper colorings on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extremal Property of Turán Graphs, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal chromatic polynomials of connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bipartite Swapping Trick on Graph Homomorphisms / rank
 
Normal rank

Latest revision as of 09:41, 15 July 2024

scientific article
Language Label Description Also known as
English
Maximizing the number of \(x\)-colorings of 4-chromatic graphs
scientific article

    Statements

    Maximizing the number of \(x\)-colorings of 4-chromatic graphs (English)
    0 references
    0 references
    5 April 2018
    0 references
    \(x\)-coloring
    0 references
    chromatic number
    0 references
    \(k\)-chromatic
    0 references
    chromatic polynomial
    0 references
    \(k\)-connected graph
    0 references
    subdivision
    0 references
    theta graph
    0 references

    Identifiers