Rainbow connection and minimum degree (Q2446307)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rainbow connection and minimum degree	scientific article

Statements

scholarly article

0 references

Rainbow connection and minimum degree (English)

0 references

Ingo Schiermeyer

0 references

Discrete Applied Mathematics

0 references

publication date

16 April 2014

0 references

zbMATH Keywords

edge colouring

0 references

rainbow connected

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2011.10.009

0 references

0 references

On rainbow connection

0 references

Rainbow connection in graphs

0 references

Graphs with rainbow connection number two

0 references

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

0 references

Rainbow Connection in Graphs with Minimum Degree Three

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2011.10.009

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2446307

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