On weak chromatic polynomials of mixed graphs (Q489344): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Enumeration of Golomb rulers and acyclic orientations of mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed graph edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Generalized Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4123353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems and Mixed Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered structures and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank

Revision as of 12:34, 9 July 2024

scientific article
Language Label Description Also known as
English
On weak chromatic polynomials of mixed graphs
scientific article

    Statements

    On weak chromatic polynomials of mixed graphs (English)
    0 references
    0 references
    0 references
    20 January 2015
    0 references
    weak chromatic polynomial
    0 references
    mixed graph
    0 references
    poset
    0 references
    \(\omega\)-labeling
    0 references
    order polynomial
    0 references
    combinatorial reciprocity theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references