Colorful monochromatic connectivity (Q2275401)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Colorful monochromatic connectivity	scientific article

Statements

scholarly article

0 references

Colorful monochromatic connectivity (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.disc.2011.04.020

0 references

0 references

0 references

Discrete Mathematics

0 references

publication date

8 August 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

coloring

0 references

monochromatic

0 references

connectivity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2011.04.020

0 references

0 references

On rainbow connection

0 references

Hardness and Algorithms for Rainbow Connectivity

0 references

Rainbow connection in graphs

0 references

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2275401

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