Domination in Planar Graphs

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, we present results on the core domination parameters in planar graphs. We shall adopt the following terminology for planar graphs. A graph is said to be planar if it can be drawn in the plane in such a way that no two edges intersect, except at a vertex to which they are both incident.

Original languageEnglish
Title of host publicationSpringer Monographs in Mathematics
PublisherSpringer Science and Business Media Deutschland GmbH
Pages325-352
Number of pages28
DOIs
Publication statusPublished - 2023

Publication series

NameSpringer Monographs in Mathematics
ISSN (Print)1439-7382
ISSN (Electronic)2196-9922

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Domination in Planar Graphs'. Together they form a unique fingerprint.

Cite this