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: | Chunyu Tian, Lei Sun |
---|---|
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 |
Similar Items
-
Light Graphs In Planar Graphs Of Large Girth
by: Hudák Peter, et al.
Published: (2016-02-01) -
Equitable Coloring of IC-Planar Graphs with Girth <i>g</i> ≥ 7
by: Danjun Huang, et al.
Published: (2023-08-01) -
The 4-girth-thickness of the complete multipartite graph
by: Christian Rubio-Montiel
Published: (2019-04-01) -
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
by: Wang Hui, et al.
Published: (2023-04-01) -
Injective coloring of planar graphs with girth 5
by: Yuehua Bu, et al.
Published: (2023-05-01)