Weifan Wang

,

Discret. Appl. Math., 2025

Strict neighbor-distinguishing index of outerplanar graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2025

Dynamic coloring of IC-planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

Acyclic choosability of IC-planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

1-Planar graphs with no 5-cycles are 5-degenerate.

[BibT_eX]

[DOI]

Qingqin Wu

,

,

Appl. Math. Comput., 2025

Proper conflict-free 6-coloring of planar graphs without short cycles.

[BibT_eX]

[DOI]

Yunlong Wang

,

,

Appl. Math. Comput., 2025

Linear arboricity of 1-planar graphs.

[BibT_eX]

[DOI]

,

Juan Liu

,

Discuss. Math. Graph Theory, 2024

Spectral extrema of 1-planar graphs.

[BibT_eX]

[DOI]

Wenqian Zhang

,

Jianfeng Wang

,

Discret. Math., 2024

A note on the list vertex-arboricity of IC-planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2024

A sufficient condition for a graph to be fractional (k,n)-critical.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2024

Nowhere-Zero 3-Flows in Signed Planar Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2024

A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable.

[BibT_eX]

[DOI]

Ganchao Zhang

,

,

Appl. Math. Comput., 2024

Partitioning planar graphs into bounded degree forests.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2024

Isolated toughness and fractional (a,b,n)-critical graphs.

[BibT_eX]

[DOI]

,

,

Yaojun Chen

Connect. Sci., December, 2023

1-planar graphs are odd 13-colorable.

[BibT_eX]

[DOI]

,

,

Gexin Yu

Discret. Math., August, 2023

IC-planar graphs are odd-10-colorable.

[BibT_eX]

[DOI]

Chenran Pan

,

,

Appl. Math. Comput., August, 2023

2-Distance choosability of planar graphs with a restriction for maximum degree.

[BibT_eX]

[DOI]

Jiahao Yu

,

,

Appl. Math. Comput., July, 2023

The Difference of Zagreb Indices of Halin Graphs.

[BibT_eX]

[DOI]

Lina Zheng

,

,

Axioms, May, 2023

Neighbor-distinguishing indices of planar graphs with maximum degree ten.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., April, 2023

Strict neighbor-distinguishing index of K4-minor-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., April, 2023

The strong chromatic index of 1-planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2023

An (F3, F5)-partition of planar graphs with girth at least 5.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2023

Plane graphs of diameter two are 2-optimal.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2023

Star Chromatic Index of 1-Planar Graphs.

[BibT_eX]

[DOI]

,

,

,

Symmetry, 2022

Light edges in 1-planar graphs.

[BibT_eX]

[DOI]

Juan Liu

,

,

J. Graph Theory, 2022

Nowhere-zero 3-flows in toroidal graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2022

Structure and pancyclicity of maximal planar graphs with diameter two.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Optim., 2022

Fuzzy fractional factors in fuzzy graphs.

[BibT_eX]

[DOI]

,

,

Lina Zheng

Int. J. Intell. Syst., 2022

On 3-flow-critical graphs.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 2022

Two sufficient conditions for a planar graph to be list vertex-2-arborable.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

Vertex-arboricity of toroidal graphs without K5- and 6-cycles.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2022

A sufficient condition for a planar graph to be (F, F2)-partitionable.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2022

Tight isolated toughness bound for fractional (k, n)-critical graphs.

[BibT_eX]

[DOI]

,

,

Yaojun Chen

Discret. Appl. Math., 2022

On the Zero Forcing Number and Spectral Radius of Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2022

Strong Chromatic Index of Outerplanar Graphs.

[BibT_eX]

[DOI]

,

,

,

Axioms, 2022

IC-Planar Graphs Are 6-Choosable.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2021

Tight binding number bound for P≥3-factor uniform graphs.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2021

Tight bounds for the existence of path factors in network vulnerability parameter settings.

[BibT_eX]

[DOI]

,

,

Yaojun Chen

Int. J. Intell. Syst., 2021

Acyclic Edge Coloring of Chordal Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Yulai Ma

,

Yongtang Shi

,

Graphs Comb., 2021

Strict Neighbor-Distinguishing Index of Subcubic Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2021

Entire coloring of 2-connected plane graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2021

A note on strong edge choosability of toroidal subcubic graphs.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 2021

Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2020

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2020

Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Algorithms Appl., 2020

An improved upper bound for the acyclic chromatic number of 1-planar graphs.

[BibT_eX]

[DOI]

Wanshun Yang

,

,

Discret. Appl. Math., 2020

Choosability with separation of planar graphs without prescribed cycles.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2020

Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2019

Acyclic coloring of IC-planar graphs.

[BibT_eX]

[DOI]

Wanshun Yang

,

,

Discret. Math., 2019

Light structures in 1-planar graphs with an application to linear 2-arboricity.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2019

Star edge-coloring of graphs with maximum degree four.

[BibT_eX]

[DOI]

Ying Wang

,

,

Appl. Math. Comput., 2019

List coloring and diagonal coloring for plane graphs of diameter two.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2019

Planar graphs without chordal 5-cycles are 2-good.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2018

2-Distance vertex-distinguishing index of subcubic graphs.

[BibT_eX]

[DOI]

Victor Loumngam Kamga

,

,

Ying Wang

,

J. Comb. Optim., 2018

Strong chromatic index of K4-minor free graphs.

[BibT_eX]

[DOI]

,

,

Inf. Process. Lett., 2018

Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion.

[BibT_eX]

[DOI]

,

Int. J. Comput. Math., 2018

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2018

2-distance vertex-distinguishing total coloring of graphs.

[BibT_eX]

[DOI]

Yafang Hu

,

Discret. Math. Algorithms Appl., 2018

Planar graphs with maximum degree 4 are strongly 19-edge-colorable.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2018

A note on the list vertex arboricity of toroidal graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2018

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2018

Planar graphs without chordal 6-cycles are 4-choosable.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2018

The neighbor expanded sum distinguishing index of Halin graphs.

[BibT_eX]

,

Wai Chee Shiu

,

Ars Comb., 2018

Edge-partition and star chromatic index.

[BibT_eX]

[DOI]

,

,

Ying Wang

Appl. Math. Comput., 2018

On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.

[BibT_eX]

[DOI]

,

Weiqiang Yu

,

Appl. Math. Comput., 2018

The entire chromatic number of graphs embedded on the torus with large maximum degree.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2017

A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2017

Neighbor-sum-distinguishing edge choosability of subcubic graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2017

A sufficient condition for planar graphs to be (3, 1)-choosable.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2017

Neighbor Sum Distinguishing Index of Subcubic Graphs.

[BibT_eX]

[DOI]

,

,

Chuandong Xu

Graphs Comb., 2017

A note on the linear 2-arboricity of planar graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2017

The chromatic number of the square of a Halin graph with maximum degree five is six.

[BibT_eX]

,

,

Ars Comb., 2017

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Glob. Optim., 2016

The 2-surviving rate of planar graphs without 5-cycles.

[BibT_eX]

[DOI]

Tingting Wu

,

,

J. Comb. Optim., 2016

The entire choosability of plane graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2016

A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2016

A (3, 1) ∗-choosable theorem on planar graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2016

Rainbow cliques in edge-colored graphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2016

Plane graphs with maximum degree 9 are entirely 11-choosable.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2016

List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles.

[BibT_eX]

[DOI]

,

Li Huang

,

Discret. Math., 2016

A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2015

Some bounds on the neighbor-distinguishing index of graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2015

Adjacent vertex distinguishing indices of planar graphs without 3-cycles.

[BibT_eX]

[DOI]

,

Zhengke Miao

,

Discret. Math., 2015

Equitable total-coloring of subcubic graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2015

(2, 1)-total labeling of trees with large maximum degree.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2015

The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures.

[BibT_eX]

[DOI]

,

Comput. Math. Methods Medicine, 2015

Full Orientability of the Square of a Cycle.

[BibT_eX]

Fengwei Xu

,

,

Ars Comb., 2015

The 2-surviving rate of planar graphs without 6-cycles.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2014

Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2014

On Neighbor-Distinguishing Index of Planar Graphs.

[BibT_eX]

[DOI]

Mirko Hornák

,

,

J. Graph Theory, 2014

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2014

The adjacent vertex distinguishing total coloring of planar graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2014

A lower bound of the surviving rate of a planar graph with girth at least seven.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2014

Star list chromatic number of planar subcubic graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2014

Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2014

Structural properties and surviving rate of planar graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math. Algorithms Appl., 2014

The surviving rate of digraphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

The edge-face choosability of plane graphs with maximum degree at least 9.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2014

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2013

6-Star-Coloring of Subcubic Graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2013

Acyclic edge coloring of planar graphs without 4-cycles.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2013

Vertex arboricity of planar graphs without chordal 6-cycles.

[BibT_eX]

[DOI]

,

Int. J. Comput. Math., 2013

Linear Coloring of Planar Graphs Without 4-Cycles.

[BibT_eX]

[DOI]

,

Graphs Comb., 2013

A new upper bound on the acyclic chromatic indices of planar graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2013

Acyclic list edge coloring of outerplanar graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2013

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2013

The 2-surviving rate of planar graphs without 4-cycles.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2012

The surviving rate of planar graphs.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2012

On backbone coloring of graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2012

Acyclic chromatic indices of planar graphs with girth at least five.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2012

Some results on the injective chromatic number of graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2012

Vertex-arboricity of planar graphs without intersecting triangles.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2012

An improved bound on parity vertex colourings of outerplane graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

A note on the adjacent vertex distinguishing total chromatic number of graphs.

[BibT_eX]

[DOI]

,

,

Chengchao Yan

Discret. Math., 2012

On the vertex-arboricity of planar graphs without 7-cycles.

[BibT_eX]

[DOI]

,

Wai Chee Shiu

,

Discret. Math., 2012

Acyclic edge coloring of planar graphs without 5-cycles.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2012

Every 4-regular graph is acyclically edge-6-colorable

[BibT_eX]

[DOI]

,

,

CoRR, 2012

Planar Graphs of Maximum Degree Six without 7-cycles are Class One.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2012

Fault tolerant path-embedding in locally twisted cubes.

[BibT_eX]

Caiyue Ye

,

Meijie Ma

,

Ars Comb., 2012

A Note on General Neighbor-Distinguishing Total Coloring of Graphs.

[BibT_eX]

,

,

Jianxing Yin

Ars Comb., 2012

The surviving rate of an outerplanar graph for the firefighter problem.

[BibT_eX]

[DOI]

,

Xubin Yue

,

Theor. Comput. Sci., 2011

Entire colouring of plane graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2011

8-star-choosability of a graph with maximum average degree less than 3.

[BibT_eX]

[DOI]

,

,

Discret. Math. Theor. Comput. Sci., 2011

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.

[BibT_eX]

[DOI]

Yuehua Bu

,

,

Discuss. Math. Graph Theory, 2011

Upper bounds on the linear chromatic number of a graph.

[BibT_eX]

[DOI]

Chao Li

,

,

Discret. Math., 2011

Acyclic chromatic indices of planar graphs with large girth.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2011

Adjacent vertex-distinguishing edge colorings of K4-minor free graphs.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2011

The surviving rate of an infected network.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2010

Choosability of toroidal graphs without short cycles.

[BibT_eX]

[DOI]

Leizhen Cai

,

,

J. Graph Theory, 2010

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2010

Adjacent vertex distinguishing total colorings of outerplanar graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2010

The Surviving Rate of a Graph for the Firefighter Problem.

[BibT_eX]

[DOI]

Leizhen Cai

,

SIAM J. Discret. Math., 2009

Planar graphs without 4-cycles are acyclically 6-choosable.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2009

Star coloring of sparse graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2009

(2, 1)-Total number of trees with maximum degree three.

[BibT_eX]

[DOI]

,

Dong Chen

Inf. Process. Lett., 2009

(2, 1)-Total labelling of trees with sparse vertices of maximum degree.

[BibT_eX]

[DOI]

,

,

,

Inf. Process. Lett., 2009

The edge-face coloring of graphs embedded in a surface of characteristic zero.

[BibT_eX]

[DOI]

Discret. Math., 2009

Linear coloring of planar graphs with large girth.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2009

On (d, 1)-total numbers of graphs.

[BibT_eX]

[DOI]

,

Daphne Der-Fen Liu

,

Discret. Math., 2009

Edge choosability of planar graphs without 5-cycles with a chord.

[BibT_eX]

[DOI]

,

Weiyi Zhu

,

Discret. Math., 2009

Injective coloring of planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2009

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2009

Coupled choosability of plane graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2008

A relaxation of Havel's 3-color problem.

[BibT_eX]

[DOI]

,

,

,

Inf. Process. Lett., 2008

On the vertex-arboricity of planar graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2008

Diameters of uniform subset graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Acyclic 5-choosability of planar graphs without 4-cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Labelling planar graphs without 4-cycles with a condition on distance two.

[BibT_eX]

[DOI]

,

Leizhen Cai

Discret. Appl. Math., 2008

Improper choosability of graphs of nonnegative characteristic.

[BibT_eX]

[DOI]

,

Weiyi Zhu

,

Comput. Math. Appl., 2008

Note on Coloring the Square of an Outerplanar Graph.

[BibT_eX]

,

Ars Comb., 2008

On 3-colorable planar graphs without short cycles.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2008

A sufficient condition for a planar graph to be class 1.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2007

Total chromatic number of planar graphs with maximum degree ten.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Acyclic 5-choosability of planar graphs without small cycles.

[BibT_eX]

[DOI]

Mickaël Montassier

,

,

J. Graph Theory, 2007

On 3-colorable planar graphs without cycles of four lengths.

[BibT_eX]

[DOI]

Xiaofang Luo

,

,

Inf. Process. Lett., 2007

Three-coloring planar graphs without short cycles.

[BibT_eX]

[DOI]

,

,

Inf. Process. Lett., 2007

On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2007

On 3-colorable planar graphs without prescribed cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

(2, 1)-Total labelling of outerplanar graphs.

[BibT_eX]

[DOI]

Dong Chen

,

Discret. Appl. Math., 2007

L(p, q)-labelling of K4-minor free graphs.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2006

The 2-dipath chromatic number of Halin graphs.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2006

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers.

[BibT_eX]

[DOI]

Discret. Math., 2006

Bordeaux 3-color conjecture and 3-choosability.

[BibT_eX]

[DOI]

Mickaël Montassier

,

,

Discret. Math., 2006

Some sufficient conditions for a planar graph of maximum degree six to be Class 1.

[BibT_eX]

[DOI]

Yuehua Bu

,

Discret. Math., 2006

The L(2, 1)-labelling of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

List Coloring Halin Graphs.

[BibT_eX]

,

Ars Comb., 2005

The edge-face choosability of plane graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2004

Vertex-pancyclicity of edge-face-total graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

The Linear 2-Arboricity of Outerplanar Graphs.

[BibT_eX]

,

Li-Da Tong

,

Ars Comb., 2004

Labeling Planar Graphs with Conditions on Girth and Distance Two.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2003

The Linear 2-Arboricity of Planar Graphs.

[BibT_eX]

[DOI]

,

Li-Da Tong

,

Graphs Comb., 2003

Coloring the square of a K4-minor free graph.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2003

Relaxed game chromatic number of graphs.

[BibT_eX]

[DOI]

Chun-Yen Chou

,

,

Discret. Math., 2003

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2002

Edge-partitions of planar graphs and their game coloring numbers.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2002

Equitable Total Coloring of Graphs with Maximum Degree 3.

[BibT_eX]

[DOI]

Graphs Comb., 2002

A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Edge-pancyclicity of coupled graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2002

Choosability and edge choosability of planar graphs without five cycles.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2002

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2001

Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2001

A note on list improper coloring planar graphs.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2001

The 4-choosability of planar graphs without 6-cycles.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2001

Upper Bounds of Entire Chromatic Number of Plane Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

Edge-face chromatic number of plane graphs with high maximum degree.

[BibT_eX]

[DOI]

,

Kemin Zhang

Australas. J Comb., 1998

On the vertex face total chromatic number of planar graphs.

[BibT_eX]

[DOI]

,

Jiazhuang Liu

J. Graph Theory, 1996

On the colorings of outerplanar graphs.

[BibT_eX]

[DOI]