Every bipartite graph without isolated vertices has conflict-free chromatic index at most 3.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Conflict-free chromatic index of bipartite graphs
Every bipartite graph without isolated vertices has conflict-free chromatic index at most 3.