scholarly journals Equitable vertex arboricity of subcubic graphs

2016 ◽  
Vol 339 (6) ◽  
pp. 1724-1726 ◽  
Author(s):  
Xin Zhang
Keyword(s):  
Vertex Arboricity ◽  
Subcubic Graphs

scholarly journals Independent domination in subcubic graphs

2021 ◽  
Author(s):  
A. Akbari ◽  
S. Akbari ◽  
A. Doosthosseini ◽  
Z. Hadizadeh ◽  
Michael A. Henning ◽  
...  
Keyword(s):  
Independent Domination ◽  
Subcubic Graphs

On 3-Bisections in Cubic and Subcubic Graphs

2021 ◽  
Author(s):  
Davide Mattiolo ◽  
Giuseppe Mazzuoccolo
Keyword(s):  
Subcubic Graphs

Strong Equitable Vertex Arboricity in Cartesian Product Networks

2021 ◽  
pp. 2150010
Author(s):  
Zhiwei Guo ◽  
Yaping Mao ◽  
Nan Jia ◽  
He Li
Keyword(s):  
Maximum Degree ◽  
Cartesian Product ◽  
Color Class ◽  
Vertex Arboricity

An equitable [Formula: see text]-tree-coloring of a graph [Formula: see text] is defined as a [Formula: see text]-coloring of vertices of [Formula: see text] such that each component of the subgraph induced by each color class is a tree of maximum degree at most [Formula: see text], and the sizes of any two color classes differ by at most one. The strong equitable vertex [Formula: see text]-arboricity of a graph [Formula: see text] refers to the smallest integer [Formula: see text] such that [Formula: see text] has an equitable [Formula: see text]-tree-coloring for every [Formula: see text]. In this paper, we investigate the Cartesian product with respect to the strong equitable vertex [Formula: see text]-arboricity, and demonstrate the usefulness of the proposed constructions by applying them to some instances of product networks.

scholarly journals Bounds and complexity results for strong edge colouring of subcubic graphs

2011 ◽  
Vol 38 ◽  
pp. 463-468
Author(s):  
Hervé Hocquard ◽  
Pascal Ochem ◽  
Petru Valicov
Keyword(s):  
Complexity Results ◽  
Subcubic Graphs ◽  
Edge Colouring

Vertex arboricity of planar graphs without intersecting 5-cycles

2017 ◽  
Vol 35 (2) ◽  
pp. 365-372 ◽  
Author(s):  
Hua Cai ◽  
Jianliang Wu ◽  
Lin Sun
Keyword(s):  
Planar Graphs ◽  
Vertex Arboricity

On a star chromatic index of subcubic graphs

2017 ◽  
Vol 61 ◽  
pp. 835-839
Author(s):  
Borut Lužar ◽  
Martina Mockovčiaková ◽  
Roman Soták
Keyword(s):  
Chromatic Index ◽  
Subcubic Graphs

scholarly journals Vertex arboricity of integer distance graph G(Dm,k)

2009 ◽  
Vol 309 (6) ◽  
pp. 1649-1657 ◽  
Author(s):  
Lian-Cui Zuo ◽  
Qinglin Yu ◽  
Jian-Liang Wu
Keyword(s):  
Distance Graph ◽  
Vertex Arboricity

A note on the list vertex arboricity of toroidal graphs

2018 ◽  
Vol 341 (12) ◽  
pp. 3344-3347
Author(s):  
Yiqiao Wang ◽  
Min Chen ◽  
Weifan Wang
Keyword(s):  
Vertex Arboricity ◽  
Toroidal Graphs

2-Distance vertex-distinguishing index of subcubic graphs

2018 ◽  
Vol 36 (1) ◽  
pp. 108-120 ◽  
Author(s):  
Victor Loumngam Kamga ◽  
Weifan Wang ◽  
Ying Wang ◽  
Min Chen
Keyword(s):  
Subcubic Graphs

A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles

2020 ◽  
Vol 836 ◽  
pp. 53-58
Author(s):  
Xuyang Cui ◽  
Wenshun Teng ◽  
Xing Liu ◽  
Huijuan Wang
Keyword(s):  
Planar Graphs ◽  
Vertex Arboricity
Sign in / Sign up

Export Citation Format

Share Document