Coupon coloring of some special graphs
From MaRDI portal
Publication:512874
DOI10.1007/s10878-015-9942-2zbMath1364.05030OpenAlexW2188450597MaRDI QIDQ512874
Meiqin Wei, Jun Yue, Yongtang Shi, Yan Zhao
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9942-2
Related Items
Coupon coloring of lexicographic product of graphs, Perfect Italian domination in cographs, Rainbow domination numbers of generalized Petersen graphs, Coloring in graphs of twist knots, On coupon coloring of Cayley graphs, Coupon coloring of cographs, Coupon-coloring and total domination in Hamiltonian planar triangulations, The generalized 3-connectivity of the Mycielskian of a graph, Some progress on the restrained Roman domination, Integer linear programming models for the weighted total domination problem, Note on the perfect Roman domination number of graphs, Role colouring graphs in hereditary classes, Domination in hexagonal chains, NP-completeness results for partitioning a graph into total dominating sets, Role coloring bipartite graphs, On the double Roman domination of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
- Rainbow connection in 3-connected graphs
- Injective colorings of graphs with low average degree
- Injective colorings of sparse graphs
- Some bounds on the injective chromatic number of graphs
- Injective colorings of planar graphs with few colors
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- Rainbow connections of graphs: a survey
- On coupon colorings of graphs
- On the rainbow vertex-connection
- INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7
- Deploying Robots With Two Sensors inK1, 6-Free Graphs
- Injective coloring of planar graphs
