Minimalk-saturated and color critical graphs of prescribed minimum degree

DOI10.1002/jgt.3190100109zbMath0593.05040OpenAlexW2057226219MaRDI QIDQ3722535

No author found.

Publication date: 1986

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

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

zbMATH Keywords

chromatic numberminimum degreesaturated graphminimum number of edgesforbidden complete graph

Mathematics Subject Classification ID

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

Related Items (10)

On the size of \((K_t, K_{1, k})\)-co-critical graphs ⋮ Maximal triangle‐free graphs with restrictions on the degrees ⋮ On the size of \((K_t, P_k)\)-co-critical graphs ⋮ Minimum degree and the minimum size of \(K_2^t\)-saturated graphs ⋮ Saturated Graphs of Prescribed Minimum Degree ⋮ Regular saturated graphs and sum-free sets ⋮ Unnamed Item ⋮ The ubiquitous Petersen graph ⋮ Saturation numbers for Ramsey-minimal graphs ⋮ Intersecting designs from linear programming and graphs of diameter two

This page was built for publication: Minimalk-saturated and color critical graphs of prescribed minimum degree