Strong parity edge-colorings are exactly refinements of canonical edge-colorings from injective binary labelings, yielding exact and asymptotic color counts and a bipartite counterexample.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Strong parity edge-colorings of graphs
Strong parity edge-colorings are exactly refinements of canonical edge-colorings from injective binary labelings, yielding exact and asymptotic color counts and a bipartite counterexample.