Distance-local rainbow connection number

DOI10.7151/DMGT.2325MaRDI QIDQ2158184zbMATH OpenOpenAlexFDO

Authors Fendy Septyanto, K. A. Sugeng

Publication date 26 July 2022

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2325

zbMATH Keywords

rainbow connectivityedge coloring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Rainbow connection in graphs
• Rainbow connection of the join of two paths.
• On various (strong) rainbow connection numbers of graphs
• (Strong) rainbow connection number of three classes of graphs
• On the strong rainbow connection of a graph
• scientific article; zbMATH DE number 6837036
• Bounds for the rainbow connection number of graphs
• Total rainbow connection of digraphs
• Color connection in graphs intermediate to proper and rainbow connection

Cites work

• A solution to a conjecture on two rainbow connection numbers of a graph.
• Color code techniques in rainbow connection
• On rainbow total-coloring of a graph
• Rainbow connection for some families of hypergraphs
• Rainbow connection in graphs
• Rainbow connection in oriented graphs
• Rainbow trees in graphs and generalized connectivity
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The rainbow connectivity of a graph

Cited in

(2)

• On distance local connectivity and vertex distance colouring
• Rainbow connection number of corona product of graphs

This page was built for publication: Distance-local rainbow connection number

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