Parameterized complexity of coupon coloring of graphs

DOI10.1007/978-3-031-83438-7_3MaRDI QIDQ6969516zbMATH OpenFDO

Authors Pradeesha Ashok, Pradyun Devarakonda, Shiven Phogat, Swaroop A. Ram Rayala, J. A. Sherin

Publication date 20 June 2025

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

zbMATH Keywords

coupon coloringfixed parameter tractableparameterized complexitytotal domatic number

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

• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• 2-Coupon Coloring of Cubic Graphs Containing 3-Cycle or 4-Cycle
• A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
• Algorithmic meta-theorems for restrictions of treewidth
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Coupon coloring of cographs
• Coupon coloring of Kneser graph K(n,2)
• Coupon coloring of some special graphs
• Cubic graphs with total domatic number at least two
• Density conditions for panchromatic colourings of hypergraphs
• Deploying robots with two sensors in \(K_{1,6}\)-free graphs
• scientific article; zbMATH DE number 6515825 (Why is no real title available?)
• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• scientific article; zbMATH DE number 1506511 (Why is no real title available?)
• scientific article; zbMATH DE number 6783431 (Why is no real title available?)
• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• NP-completeness results for partitioning a graph into total dominating sets
• On a hypercube coloring problem
• On coupon coloring of Cartesian product of some graphs
• On coupon coloring of Cayley graphs
• On coupon colorings of graphs
• On Integer Programming, Discrepancy, and Convolution
• On the complexity of k-SAT
• On the number of list‐colorings
• On the total domatic number of regular graphs
• Parameterized algorithms
• Structural parameterization for minimum conflict-free colouring
• The b-chromatic number of a graph

This page was built for publication: Parameterized complexity of coupon coloring of graphs

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