On coupon colorings of graphs
From MaRDI portal
Publication:2354722
DOI10.1016/j.dam.2015.04.026zbMath1317.05052arXiv1404.6278OpenAlexW1480991993MaRDI QIDQ2354722
Michael Tait, Jeong Han Kim, Bob Chen, Jacques Verstraete
Publication date: 24 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6278
Related Items (20)
On coupon coloring of Cartesian product of some graphs ⋮ Coupon coloring of lexicographic product of graphs ⋮ Maker-breaker total domination game ⋮ Coloring in graphs of twist knots ⋮ On domatic and total domatic numbers of Cartesian products of graphs ⋮ Cubic graphs with total domatic number at least two ⋮ On coupon coloring of Cayley graphs ⋮ Disjoint total dominating sets in near‐triangulations ⋮ Coupon coloring of cographs ⋮ Coupon coloring of some special graphs ⋮ k-tuple restrained domination in graphs ⋮ Coupon-coloring and total domination in Hamiltonian planar triangulations ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ Role colouring graphs in hereditary classes ⋮ NP-completeness results for partitioning a graph into total dominating sets ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Distance Domination in Graphs ⋮ A characterization of graphs with disjoint total dominating sets ⋮ Role coloring bipartite graphs ⋮ Domatically full Cartesian product graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Injective colorings of graphs with low average degree
- On a hypercube coloring problem
- Injective colorings of sparse graphs
- Random constructions and density results
- Injective colorings of planar graphs with few colors
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- A coloring problem on the \(n\)-cube
- Density conditions for panchromatic colourings of hypergraphs
- Short cycles in random regular graphs
- Transversal numbers of uniform hypergraphs
- On the injective chromatic number of graphs
- General properties of some families of graphs defined by systems of equations
- INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7
- Deploying Robots With Two Sensors inK1, 6-Free Graphs
- On Brooks' Theorem for Sparse Graphs
- On the size of a random sphere of influence graph
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Injective coloring of planar graphs
This page was built for publication: On coupon colorings of graphs