Rainbow connectivity and proper rainbow connectivity of (1,s,t)

zbMATH Open1469.05055MaRDI QIDQ4958433FDOQ4958433

Authors: Stephanie Dorough, P. D. jun. Johnson 

Publication date: 13 September 2021

Full work available at URL: http://ijmcs.future-in-tech.net/16.4/R-Johnson-Dorough.pdf

Recommendations

• On proper (strong) rainbow connection of graphs
• Proper rainbow connection number of graphs
• scientific article; zbMATH DE number 7144826
• Rainbow and strong rainbow connection number for some families of graphs
• (Strong) rainbow connection number of three classes of graphs

zbMATH Keywords

chromatic indexproper edge coloringdiameter of a connected graphrainbow-connectedstrongly rainbow-connected

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (2)

• On proper (strong) rainbow connection of graphs
• Proper rainbow connection number of graphs

This page was built for publication: Rainbow connectivity and proper rainbow connectivity of \(\theta(1,s,t)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958433)