Multicolorful connectivity of trees (Q2242784)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multicolorful connectivity of trees	scientific article

Statements

scholarly article

0 references

Multicolorful connectivity of trees (English)

0 references

10.1016/j.amc.2021.126147

0 references

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

10 November 2021

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

coloring

0 references

tree

0 references

connectivity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

0 references

0 references

Proper connection of graphs

0 references

Erdős-Gallai-type results for colorful monochromatic connectivity of a graph

0 references

On rainbow connection

0 references

Colorful monochromatic connectivity

0 references

Hardness and Algorithms for Rainbow Connectivity

0 references

Rainbow connection in graphs

0 references

The rainbow connectivity of a graph

0 references

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

0 references

More on the colorful monochromatic connectivity

0 references

The monochromatic connectivity of graphs

0 references

Extremal graphs with maximum monochromatic connectivity

0 references

Rainbow connections of graphs: a survey

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2242784

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