Peer-reviewedLicence not statedJournal of Graph Theory
Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
- 1Department of Mathematics Western Michigan University Kalamazoo Michigan USA
- 2Department of Mathematics and Statistics California State Polytechnic University Pomona California USA
- 3Department of Mathematics Iowa State University Ames Iowa USA
Related
- Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable
- Graph Coloring with Color Preferences
- Local-to-Global Theorems Based on Cones with Applications to Graph Coloring
- Dynamic Coloring and Graph Squares of Regular Graphs
- Almost Every Graph Is Reconstructible from Its Token Graphs
BibTeX
@article{bennett2026edgecoloring,
title = {{Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class}},
author = {Patrick Bennett and Emily Heath and Shira Zerbib},
journal = {Journal of Graph Theory},
year = {2026},
month = oct,
doi = {10.1002/jgt.70151},
url = {https://doi.org/10.1002/jgt.70151},
}
RIS
TY - JOUR
TI - Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
AU - Patrick Bennett
AU - Emily Heath
AU - Shira Zerbib
PY - 2026
DA - 2026/10/31
JO - Journal of Graph Theory
DO - 10.1002/jgt.70151
UR - https://doi.org/10.1002/jgt.70151
SN - 0364-9024
SN - 1097-0118
ER -