scientific article; zbMATH DE number 975388

MaRDI QIDQ5284062zbMATH OpenFDO

Authors Jing Zou, Stanisław P. Radziszowski

Publication date 19 May 1997

zbMATH Keywords

neighborhoodRamsey numbersnumber of edgesquasi-independent setminimum graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Minimizing the number of edges in (P_k ∪ K₃)-saturated connected graphs
• The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
• Minimally 3-connected graphs with exactly \(k\) non-essential edges
• Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
• A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
• Publication:4946545
• On minors of graphs with at least 3n −4 edges
• Minimally (k, k)‐edge‐connected graphs
• MinimumK_{2, 3}-Saturated Graphs
• scientific article; zbMATH DE number 572161

Cited in

(1)

• The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)

This page was built for publication:

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