EUVIMEDEUVIMED entdecken
Crossref

Partitioning planar graphs with girth at least $ 9 $ into an edgeless graph and a graph with bounded size components

Chunyu Tian, Lei Sun

Mathematical Modelling and Control · 2021

DOI: 10.3934/mmc.2021012 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Modelling and Control, 2021. Verfasst von Chunyu Tian und 1 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we study the problem of partitioning the vertex set of a planar graph with girth restriction into parts, also referred to as color classes, such that each part induces a graph with components of bounded order. An ($ \mathcal{I} $, $ \mathcal{O}_{k} $)-partition of a graph $ G $ is the partition of $ V(G) $ into two non-empty subsets $ V_{1} $ and $ V_{2} $, such that $ G[V_{1}] $ is an edgeless graph and $ G[V_{2}] $ is a graph with components of order at most $ k $. We prove that every planar graph with girth 9 and without intersecting $ 9 $-face admits an ($ \mathcal{I} $, $ \mathcal{O}_{6} $)-partition. This improves a result of Choi, Dross and Ochem (2020) which says every planar graph with girth at least $ 9 $ admits an ($ \mathcal{I} $, $ \mathcal{O}_{9} $)-partition.

Zitieren

APA

Tian, C., & Sun, L. (2021). Partitioning planar graphs with girth at least $ 9 $ into an edgeless graph and a graph with bounded size components. Mathematical Modelling and Control. https://doi.org/10.3934/mmc.2021012

Vancouver

Tian C, Sun L. Partitioning planar graphs with girth at least $ 9 $ into an edgeless graph and a graph with bounded size components. Mathematical Modelling and Control. 2021. doi:10.3934/mmc.2021012

BibTeX
@article{Tian2021,
  author = {Tian, Chunyu and Sun, Lei},
  title = {Partitioning planar graphs with girth at least $ 9 $ into an edgeless graph and a graph with bounded size components},
  journal = {Mathematical Modelling and Control},
  year = {2021},
  doi = {10.3934/mmc.2021012}
}
Kostenlos starten →