Some sharp bounds on the negative decision number of graphs

DOI10.7151/dmgt.1683zbMath1295.05177OpenAlexW2052574796MaRDI QIDQ5495047

Hongyu Liang

Publication date: 30 July 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1683

zbMATH Keywords

Nordhaus-Gaddum resultsnegative decision numberbad functionsharp upper bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Some sharp bounds on the negative decision number of graphs