On the parameterized complexity of odd coloring

DOI10.1007/978-3-031-83438-7_6MaRDI QIDQ6969509zbMATH OpenFDO

Authors Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_6

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 Linear Recognition Algorithm for Cographs
• A note on odd colorings of 1-planar graphs
• Colorings with neighborhood parity condition
• Complexity of conflict-free colorings of graphs
• Conflict-free coloring of graphs
• Conflict-free coloring of unit disks
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-free colourings of graphs and hypergraphs
• Deterministic conflict-free coloring for intervals: from offline to online
• Odd coloring of sparse graphs and planar graphs
• Online hypergraph coloring
• Parameterized algorithms
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Remarks on odd colorings of graphs
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• The odd chromatic number of a planar graph is at most 8
• Upper bounds to the clique width of graphs

Cited in

(1)

• On odd coloring of graphs

This page was built for publication: On the parameterized complexity of odd coloring

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