Chromatic polynomials of 2-edge-coloured graphs

DOI10.37236/9785arXiv2007.13710MaRDI QIDQ6117261

Danielle Cox, Christopher Duffy, Iain Beaton, Nicole Zolkavich

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

homomorphisms of edge-coloured graphssignified graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms of edge-colored graphs and Coxeter groups
• A weighted graph polynomial from chromatic invariants of knots
• Good and semi-strong colorings of oriented planar graphs
• Colored homomorphisms of colored mixed graphs
• Chromatic polynomials of oriented graphs
• The complexity of signed graph and edge-coloured graph homomorphisms
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• Limits of zeroes of recursively defined polynomials
• Chromatic Roots are Dense in the Whole Complex Plane
• Homomorphisms of Signed Graphs
• Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
• An introduction to chromatic polynomials
• Homomorphisms of 2-edge-colored graphs