Lower Ramsey numbers for graphs

DOI10.1016/0012-365X(91)90163-VzbMath0760.05068OpenAlexW2051063713MaRDI QIDQ1179278

Christina M. Mynhardt

Publication date: 26 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90163-v

zbMATH Keywords

maximal cliquesindependent dominating setslower Ramsey number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (1)

Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• On the product of upper irredundance numbers of a graph and its complement
• GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS
• Lower bounds for lower Ramsey numbers

This page was built for publication: Lower Ramsey numbers for graphs