Partitioning planar graphs with girth at least 9 into an edgeless graph and a graph with bounded size components
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-08-01
|
| Series: | Mathematical Modelling and Control |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/mmc.2021012?viewType=HTML |