Onk-saturated graphs with restrictions on the degrees

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199609)23:1<1::AID-JGT1>3.0.CO;2-O" /><1::AID-JGT1>3.0.CO;2-O 10.1002/(SICI)1097-0118(199609)23:1<1::AID-JGT1>3.0.CO;2-OzbMath0857.05051OpenAlexW4230975730WikidataQ105659434 ScholiaQ105659434MaRDI QIDQ4892338

Michael Krivelevich, Noga Alon, Ron Holzman

Publication date: 26 February 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199609)23:1<1::aid-jgt1>3.0.co;2-o

zbMATH Keywords

maximum degree\(k\)-saturated graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (7)

Saturated Graphs of Prescribed Minimum Degree ⋮ Regular saturated graphs and sum-free sets ⋮ Unnamed Item ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ Unnamed Item ⋮ Saturation numbers for Ramsey-minimal graphs ⋮ Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs

This page was built for publication: Onk-saturated graphs with restrictions on the degrees