A note on rainbow saturation number of paths

DOI10.1016/J.AMC.2020.125204OpenAlexW3014622869WikidataQ112880128 ScholiaQ112880128MaRDI QIDQ2177906FDOQ2177906

Authors: Yue-de Ma, Zhenyu Taoqiu, Shu-Juan Cao 

Publication date: 7 May 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.05222

Recommendations

• Colored saturation parameters for rainbow subgraphs
• Rainbow saturation of graphs
• Rainbow saturation
• Rainbow saturation and graph capacities
• On the rainbow Turán number of paths

zbMATH Keywords

edge-coloringpathrainbow saturation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A survey of minimum saturated graphs
• A Problem in Graph Theory
• Title not available (Why is that?)
• Large induced subgraphs with \(k\) vertices of almost maximum degree
• Rainbow saturation and graph capacities
• Colored saturation parameters for rainbow subgraphs
• On edge-colored saturation problems

Cited In (9)

• Rainbow numbers for paths in planar graphs
• A note on rainbow saturation number of paths
• Rainbow saturation of graphs
• The partite saturation number of spider
• The saturation number for the length of degree monotone paths
• Colored saturation parameters for rainbow subgraphs
• Rainbow saturation and graph capacities
• Rainbow saturation
• Rainbow Saturation for Complete Graphs

This page was built for publication: A note on rainbow saturation number of paths

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