Coupon coloring of cographs (Q1738081)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Coupon coloring of cographs	scientific article

Statements

scholarly article

0 references

Coupon coloring of cographs (English)

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

29 March 2019

0 references

zbMATH Keywords

vertex coloring

0 references

coupon coloring

0 references

coupon coloring number

0 references

cograph

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2017.03.023

0 references

Deploying Robots With Two Sensors in<i>K</i><sub>1, 6</sub>-Free Graphs

0 references

0 references

0 references

On coupon colorings of graphs

0 references

Complement reducible graphs

0 references

A Linear Recognition Algorithm for Cographs

0 references

0 references

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees

0 references

A simple linear time algorithm for cograph recognition

0 references

Rainbow connections of graphs: a survey

0 references

Rainbow connection in 3-connected graphs

0 references

On the rainbow vertex-connection

0 references

On a property of the class of n-colorable graphs

0 references

Coupon coloring of some special graphs

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.AMC.2017.03.023

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1738081

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1738081&oldid=38721672"