DP‐coloring Cartesian products of graphs

DOI10.1002/jgt.22917zbMath1522.05123arXiv2110.04700MaRDI QIDQ6074580

Unnamed Author, Jeffrey A. Mudrock, Unnamed Author, Hemanshu Kaul

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringCartesian productcorrespondence coloringDP-coloringDP-chromatic numberDP-color function

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

An algebraic approach for counting DP-3-colorings of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• When does the list-coloring function of a graph equal its chromatic polynomial
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Graph multiplication
• Recognizing Cartesian products in linear time
• The chromatic polynomial and list colorings
• A note on the DP-chromatic number of complete bipartite graphs
• Answers to two questions on the DP color function
• DP color functions versus chromatic polynomials
• Cover and variable degeneracy
• A deletion-contraction relation for the DP color function
• The DP color function of joins and vertex-gluings of graphs
• On the chromatic polynomial and counting DP-colorings of graphs
• List coloring a Cartesian product with a complete bipartite factor
• List coloring of Cartesian products of graphs
• On the number of list‐colorings
• A note on a Brooks' type theorem for DP‐coloring

This page was built for publication: DP‐coloring Cartesian products of graphs