Restraints permitting the largest number of colourings (Q1786873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Restraints for Graph Colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring satisfying restraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of list‐colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval vertex-coloring of a graph with forbidden colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amenable colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic polynomial and list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colour-critical graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: When does the list-coloring function of a graph equal its chromatic polynomial / rank
 
Normal rank

Latest revision as of 15:45, 16 July 2024

scientific article
Language Label Description Also known as
English
Restraints permitting the largest number of colourings
scientific article

    Statements

    Restraints permitting the largest number of colourings (English)
    0 references
    0 references
    0 references
    25 September 2018
    0 references
    graph colouring
    0 references
    restraint
    0 references
    chromatic polynomial
    0 references
    restrained chromatic polynomial
    0 references
    bipartite graph
    0 references

    Identifiers