Bivariate Chromatic Polynomials of Mixed Graphs
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this notion to mixed graphs, which have both directed an...
Saved in:
| Main Authors: | Matthias Beck, Sampada Kolhatkar |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-11-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/9595/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Distribution of sets of descent tops and descent bottoms on restricted permutations
by: Alexander Burstein
Published: (2025-01-01) -
Line game-perfect graphs
by: Stephan Dominique Andres, et al.
Published: (2024-09-01) -
On harmonious coloring of hypergraphs
by: Sebastian Czerwiński
Published: (2024-07-01) -
Interval and $\ell$-interval Rational Parking Functions
by: Tomás Aguilar-Fraga, et al.
Published: (2024-11-01) -
Minor-closed classes of binary functions
by: Benjamin R. Jones
Published: (2024-11-01)