go-v.orgdoi

Applications of the Kelmans Transformation: Extremality of the Threshold Graphs

Péter Csíkvári · The Electronic Journal of Combinatorics · 2011

  • DOI 10.37236/669
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2011

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2011

Abstract

In this paper we study various extremal problems related to some combinatorially defined graph polynomials such as matching polynomial, chromatic polynomial, Laplacian polynomial. It will turn out that many problems attain its extremal value in the class of threshold graphs. To attack these kinds of problems we survey several applications of the so-called Kelmans transformation.

Open the resolved locator · 10.37236/669

Metadata licence: OpenAlex metadata (CC0)