Edge-colored saturated graphs

DOI10.1002/JGT.3190110209MaRDI QIDQ3822186zbMATH OpenOpenAlexFDO

Authors D. Hanson, Bjarne Toft

Publication date 1987

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190110209

zbMATH Keywords

edge colouringextremal graphsmonochromatic complete subgraph

Mathematics Subject Classification ID

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

Recommendations

• On edge-colored saturation problems
• Saturation numbers for families of Ramsey-minimal graphs
• scientific article; zbMATH DE number 4214034
• Colored saturation parameters for rainbow subgraphs
• Rainbow saturation of graphs

Cites work

• Graph theory with applications

Cited in

(14)

• Saturation numbers for Ramsey-minimal graphs
• On the size of \((K_t, K_{1, k})\)-co-critical graphs
• On the size of \((K_t, P_k)\)-co-critical graphs
• On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
• On edge-colored saturation problems
• On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs
• Linearity of saturation for Berge hypergraphs
• Ramsey-minimal saturation numbers for matchings
• Saturation numbers for families of Ramsey-minimal graphs
• Rainbow Saturation for Complete Graphs
• The rainbow saturation number is linear
• Weak rainbow saturation numbers of graphs
• Minimizing the number of edges in \((C_4,K_{1,k})\)-co-critical graphs
• On the proper rainbow saturation numbers of cliques, paths, and odd cycles

This page was built for publication: Edge-colored saturated graphs

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