Recommendations
Cited in
(11)- Coloring graphs with no \(\text{odd-}K_4\)
- On vertex-parity edge-colorings
- Decomposition of a graph into two disjoint odd subgraphs
- 4-chromatic graphs with large odd girth
- Remarks on proper conflict-free colorings of graphs
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- Odd decompositions and coverings of graphs
- Odd edge coloring of graphs
- Totally odd K₄-subdivisions in 4-chromatic graphs
- Odd edge‐colorings of subdivisions of odd graphs
This page was built for publication: Odd 4-edge-colorability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638640)