Coupon coloring of cographs
From MaRDI portal
Publication:1738081
DOI10.1016/j.amc.2017.03.023zbMath1411.05084OpenAlexW2604434543MaRDI QIDQ1738081
Publication date: 29 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.03.023
Related Items (5)
Coupon coloring of lexicographic product of graphs ⋮ Perfect Italian domination in cographs ⋮ On coupon coloring of Cayley graphs ⋮ Role colouring graphs in hereditary classes ⋮ On the double Roman domination of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow connection in 3-connected graphs
- Coupon coloring of some special graphs
- Complement reducible graphs
- A simple linear time algorithm for cograph recognition
- Rainbow connections of graphs: a survey
- On coupon colorings of graphs
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- On a property of the class of n-colorable graphs
- On the rainbow vertex-connection
- Deploying Robots With Two Sensors inK1, 6-Free Graphs
- A Linear Recognition Algorithm for Cographs
- Dacey Graphs
This page was built for publication: Coupon coloring of cographs