On weak chromatic polynomials of mixed graphs

DOI10.1007/s00373-013-1381-1zbMath1306.05100arXiv1210.4634OpenAlexW2013943456MaRDI QIDQ489344

Yong-Cai Geng, Sumit K. Garg

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.4634

zbMATH Keywords

posetmixed graphcombinatorial reciprocity theorem\(\omega\)-labelingorder polynomialweak chromatic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On Cohen-Macaulay Hopf monoids in species ⋮ On the differential polynomial of a graph ⋮ Partial graph orientations and the Tutte polynomial ⋮ Bijective Proofs of Proper Coloring Theorems ⋮ Coloring complexes and combinatorial Hopf monoids

Cites Work

• Enumeration of Golomb rulers and acyclic orientations of mixed graphs
• Mixed graph edge coloring
• Mixed graph colorings
• Acyclic orientations of graphs
• Scheduling Problems and Mixed Graph Colorings
• On Counting Generalized Colorings
• Ordered structures and partitions
• Unnamed Item

This page was built for publication: On weak chromatic polynomials of mixed graphs