On odd coloring of graphs

DOI10.1007/978-3-032-17156-6_28MaRDI QIDQ7307338zbMATH OpenFDO

Authors Joydeep Patar, I. Vinod Reddy

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A note on odd colorings of 1-planar graphs
• Algorithmic complexity of list colorings
• Colorings with neighborhood parity condition
• Equitable Coloring
• scientific article; zbMATH DE number 7058467 (Why is no real title available?)
• On a list coloring conjecture of Reed
• On the parameterized complexity of odd coloring
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Remarks on odd colorings of graphs
• Remarks on proper conflict-free colorings of graphs
• The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs

This page was built for publication: On odd coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307338)