2023
Isolated toughness and fractional (<i>a,b,n</i>)-critical graphs.
Connect. Sci., December, 2023
1-planar graphs are odd 13-colorable.
Discret. Math., August, 2023
IC-planar graphs are odd-10-colorable.
Appl. Math. Comput., August, 2023
2-Distance choosability of planar graphs with a restriction for maximum degree.
Appl. Math. Comput., July, 2023
The Difference of Zagreb Indices of Halin Graphs.
Axioms, May, 2023
Neighbor-distinguishing indices of planar graphs with maximum degree ten.
Discret. Appl. Math., April, 2023
Strict neighbor-distinguishing index of K4-minor-free graphs.
Discret. Appl. Math., April, 2023
An (<i>F</i><sub>3</sub>, <i>F</i><sub>5</sub>)-partition of planar graphs with girth at least 5.
Discret. Math., 2023
Plane graphs of diameter two are 2-optimal.
Appl. Math. Comput., 2023
2022
Star Chromatic Index of 1-Planar Graphs.
Symmetry, 2022
Light edges in 1-planar graphs.
J. Graph Theory, 2022
Nowhere-zero 3-flows in toroidal graphs.
J. Comb. Theory, Ser. B, 2022
Structure and pancyclicity of maximal planar graphs with diameter two.
J. Comb. Optim., 2022
Fuzzy fractional factors in fuzzy graphs.
Int. J. Intell. Syst., 2022
On 3-flow-critical graphs.
Eur. J. Comb., 2022
Two sufficient conditions for a planar graph to be list vertex-2-arborable.
Discret. Math., 2022
Vertex-arboricity of toroidal graphs without K5- and 6-cycles.
Discret. Appl. Math., 2022
A sufficient condition for a planar graph to be (F, F2)-partitionable.
Discret. Appl. Math., 2022
Tight isolated toughness bound for fractional (k, n)-critical graphs.
Discret. Appl. Math., 2022
On the Zero Forcing Number and Spectral Radius of Graphs.
Electron. J. Comb., 2022
Strong Chromatic Index of Outerplanar Graphs.
Axioms, 2022
2021
IC-Planar Graphs Are 6-Choosable.
SIAM J. Discret. Math., 2021
Tight binding number bound for <i>P</i><sub>≥3</sub>-factor uniform graphs.
Inf. Process. Lett., 2021
Tight bounds for the existence of path factors in network vulnerability parameter settings.
Int. J. Intell. Syst., 2021
Acyclic Edge Coloring of Chordal Graphs with Bounded Degree.
Graphs Comb., 2021
Strict Neighbor-Distinguishing Index of Subcubic Graphs.
Graphs Comb., 2021
Entire coloring of 2-connected plane graphs.
Eur. J. Comb., 2021
A note on strong edge choosability of toroidal subcubic graphs.
Australas. J Comb., 2021
2020
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.
J. Graph Theory, 2020
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve.
J. Comb. Optim., 2020
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles.
Discret. Math. Algorithms Appl., 2020
An improved upper bound for the acyclic chromatic number of 1-planar graphs.
Discret. Appl. Math., 2020
Choosability with separation of planar graphs without prescribed cycles.
Appl. Math. Comput., 2020
2019
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.
J. Comb. Optim., 2019
Acyclic coloring of IC-planar graphs.
Discret. Math., 2019
Light structures in 1-planar graphs with an application to linear 2-arboricity.
Discret. Appl. Math., 2019
Star edge-coloring of graphs with maximum degree four.
Appl. Math. Comput., 2019
List coloring and diagonal coloring for plane graphs of diameter two.
Appl. Math. Comput., 2019
2018
Planar graphs without chordal 5-cycles are 2-good.
J. Comb. Optim., 2018
2-Distance vertex-distinguishing index of subcubic graphs.
J. Comb. Optim., 2018
Strong chromatic index of <i>K</i><sub>4</sub>-minor free graphs.
Inf. Process. Lett., 2018
Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion.
Int. J. Comput. Math., 2018
Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic.
Graphs Comb., 2018
2-distance vertex-distinguishing total coloring of graphs.
Discret. Math. Algorithms Appl., 2018
Planar graphs with maximum degree 4 are strongly 19-edge-colorable.
Discret. Math., 2018
A note on the list vertex arboricity of toroidal graphs.
Discret. Math., 2018
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.
Discret. Math., 2018
Planar graphs without chordal 6-cycles are 4-choosable.
Discret. Appl. Math., 2018
The neighbor expanded sum distinguishing index of Halin graphs.
Ars Comb., 2018
Edge-partition and star chromatic index.
Appl. Math. Comput., 2018
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.
Appl. Math. Comput., 2018
2017
The entire chromatic number of graphs embedded on the torus with large maximum degree.
Theor. Comput. Sci., 2017
A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1.
J. Comb. Optim., 2017
Neighbor-sum-distinguishing edge choosability of subcubic graphs.
J. Comb. Optim., 2017
A sufficient condition for planar graphs to be (3, 1)-choosable.
J. Comb. Optim., 2017
Neighbor Sum Distinguishing Index of Subcubic Graphs.
Graphs Comb., 2017
A note on the linear 2-arboricity of planar graphs.
Discret. Math., 2017
The chromatic number of the square of a Halin graph with maximum degree five is six.
Ars Comb., 2017
2016
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Glob. Optim., 2016
The 2-surviving rate of planar graphs without 5-cycles.
J. Comb. Optim., 2016
The entire choosability of plane graphs.
J. Comb. Optim., 2016
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable.
J. Comb. Optim., 2016
A (3, 1) ∗-choosable theorem on planar graphs.
J. Comb. Optim., 2016
Rainbow cliques in edge-colored graphs.
Eur. J. Comb., 2016
Plane graphs with maximum degree 9 are entirely 11-choosable.
Discret. Math., 2016
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles.
Discret. Math., 2016
2015
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree.
SIAM J. Discret. Math., 2015
Some bounds on the neighbor-distinguishing index of graphs.
Discret. Math., 2015
Adjacent vertex distinguishing indices of planar graphs without 3-cycles.
Discret. Math., 2015
Equitable total-coloring of subcubic graphs.
Discret. Appl. Math., 2015
(2, 1)-total labeling of trees with large maximum degree.
Discret. Appl. Math., 2015
The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures.
Comput. Math. Methods Medicine, 2015
Full Orientability of the Square of a Cycle.
Ars Comb., 2015
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time.
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
The 2-surviving rate of planar graphs without 6-cycles.
Theor. Comput. Sci., 2014
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable.
SIAM J. Discret. Math., 2014
On Neighbor-Distinguishing Index of Planar Graphs.
J. Graph Theory, 2014
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.
J. Comb. Optim., 2014
The adjacent vertex distinguishing total coloring of planar graphs.
J. Comb. Optim., 2014
A lower bound of the surviving rate of a planar graph with girth at least seven.
J. Comb. Optim., 2014
Star list chromatic number of planar subcubic graphs.
J. Comb. Optim., 2014
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.
Graphs Comb., 2014
Structural properties and surviving rate of planar graphs.
Discret. Math. Algorithms Appl., 2014
The surviving rate of digraphs.
Discret. Math., 2014
The edge-face choosability of plane graphs with maximum degree at least 9.
Discret. Math., 2014
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.
Discret. Appl. Math., 2014
2013
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4.
J. Graph Theory, 2013
6-Star-Coloring of Subcubic Graphs.
J. Graph Theory, 2013
Acyclic edge coloring of planar graphs without 4-cycles.
J. Comb. Optim., 2013
Vertex arboricity of planar graphs without chordal 6-cycles.
Int. J. Comput. Math., 2013
Linear Coloring of Planar Graphs Without 4-Cycles.
Graphs Comb., 2013
A new upper bound on the acyclic chromatic indices of planar graphs.
Eur. J. Comb., 2013
Acyclic list edge coloring of outerplanar graphs.
Discret. Math., 2013
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle.
Discret. Appl. Math., 2013
2012
The 2-surviving rate of planar graphs without 4-cycles.
Theor. Comput. Sci., 2012
The surviving rate of planar graphs.
Theor. Comput. Sci., 2012
On backbone coloring of graphs.
J. Comb. Optim., 2012
Acyclic chromatic indices of planar graphs with girth at least five.
J. Comb. Optim., 2012
Some results on the injective chromatic number of graphs.
J. Comb. Optim., 2012
Vertex-arboricity of planar graphs without intersecting triangles.
Eur. J. Comb., 2012
An improved bound on parity vertex colourings of outerplane graphs.
Discret. Math., 2012
A note on the adjacent vertex distinguishing total chromatic number of graphs.
Discret. Math., 2012
On the vertex-arboricity of planar graphs without 7-cycles.
Discret. Math., 2012
Acyclic edge coloring of planar graphs without 5-cycles.
Discret. Appl. Math., 2012
Every 4-regular graph is acyclically edge-6-colorable
CoRR, 2012
Planar Graphs of Maximum Degree Six without 7-cycles are Class One.
Electron. J. Comb., 2012
Fault tolerant path-embedding in locally twisted cubes.
Ars Comb., 2012
A Note on General Neighbor-Distinguishing Total Coloring of Graphs.
Ars Comb., 2012
2011
The surviving rate of an outerplanar graph for the firefighter problem.
Theor. Comput. Sci., 2011
Entire colouring of plane graphs.
J. Comb. Theory, Ser. B, 2011
8-star-choosability of a graph with maximum average degree less than 3.
Discret. Math. Theor. Comput. Sci., 2011
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.
Discuss. Math. Graph Theory, 2011
Upper bounds on the linear chromatic number of a graph.
Discret. Math., 2011
Acyclic chromatic indices of planar graphs with large girth.
Discret. Appl. Math., 2011
Adjacent vertex-distinguishing edge colorings of K<sub>4</sub>-minor free graphs.
Appl. Math. Lett., 2011
2010
The surviving rate of an infected network.
Theor. Comput. Sci., 2010
Choosability of toroidal graphs without short cycles.
J. Graph Theory, 2010
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.
J. Comb. Optim., 2010
Adjacent vertex distinguishing total colorings of outerplanar graphs.
J. Comb. Optim., 2010
2009
The Surviving Rate of a Graph for the Firefighter Problem.
SIAM J. Discret. Math., 2009
Planar graphs without 4-cycles are acyclically 6-choosable.
J. Graph Theory, 2009
Star coloring of sparse graphs.
J. Graph Theory, 2009
(2, 1)-Total number of trees with maximum degree three.
Inf. Process. Lett., 2009
(2, 1)-Total labelling of trees with sparse vertices of maximum degree.
Inf. Process. Lett., 2009
The edge-face coloring of graphs embedded in a surface of characteristic zero.
Discret. Math., 2009
Linear coloring of planar graphs with large girth.
Discret. Math., 2009
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.
Discret. Math., 2009
On (d, 1)-total numbers of graphs.
Discret. Math., 2009
Edge choosability of planar graphs without 5-cycles with a chord.
Discret. Math., 2009
Injective coloring of planar graphs.
Discret. Appl. Math., 2009
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.
Appl. Math. Lett., 2009
2008
Coupled choosability of plane graphs.
J. Graph Theory, 2008
A relaxation of Havel's 3-color problem.
Inf. Process. Lett., 2008
On the vertex-arboricity of planar graphs.
Eur. J. Comb., 2008
Diameters of uniform subset graphs.
Discret. Math., 2008
Acyclic 5-choosability of planar graphs without 4-cycles.
Discret. Math., 2008
Labelling planar graphs without 4-cycles with a condition on distance two.
Discret. Appl. Math., 2008
Improper choosability of graphs of nonnegative characteristic.
Comput. Math. Appl., 2008
Note on Coloring the Square of an Outerplanar Graph.
Ars Comb., 2008
On 3-colorable planar graphs without short cycles.
Appl. Math. Lett., 2008
2007
A sufficient condition for a planar graph to be class 1.
Theor. Comput. Sci., 2007
Total chromatic number of planar graphs with maximum degree ten.
J. Graph Theory, 2007
Acyclic 5-choosability of planar graphs without small cycles.
J. Graph Theory, 2007
On 3-colorable planar graphs without cycles of four lengths.
Inf. Process. Lett., 2007
Three-coloring planar graphs without short cycles.
Inf. Process. Lett., 2007
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability.
Eur. J. Comb., 2007
On 3-colorable planar graphs without prescribed cycles.
Discret. Math., 2007
(2, 1)-Total labelling of outerplanar graphs.
Discret. Appl. Math., 2007
2006
L(p, q)-labelling of K<sub>4</sub>-minor free graphs.
Inf. Process. Lett., 2006
The 2-dipath chromatic number of Halin graphs.
Inf. Process. Lett., 2006
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers.
Discret. Math., 2006
Bordeaux 3-color conjecture and 3-choosability.
Discret. Math., 2006
Some sufficient conditions for a planar graph of maximum degree six to be Class 1.
Discret. Math., 2006
The <i>L</i>(2, 1)-labelling of trees.
Discret. Appl. Math., 2006
2005
List Coloring Halin Graphs.
Ars Comb., 2005
2004
The edge-face choosability of plane graphs.
Eur. J. Comb., 2004
Vertex-pancyclicity of edge-face-total graphs.
Discret. Appl. Math., 2004
The Linear 2-Arboricity of Outerplanar Graphs.
Ars Comb., 2004
2003
Labeling Planar Graphs with Conditions on Girth and Distance Two.
SIAM J. Discret. Math., 2003
The Linear 2-Arboricity of Planar Graphs.
Graphs Comb., 2003
Coloring the square of a <i>K</i><sub>4</sub>-minor free graph.
Discret. Math., 2003
Relaxed game chromatic number of graphs.
Discret. Math., 2003
2002
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.
SIAM J. Discret. Math., 2002
Edge-partitions of planar graphs and their game coloring numbers.
J. Graph Theory, 2002
Equitable Total Coloring of Graphs with Maximum Degree 3.
Graphs Comb., 2002
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.
Discret. Math., 2002
Edge-pancyclicity of coupled graphs.
Discret. Appl. Math., 2002
Choosability and edge choosability of planar graphs without five cycles.
Appl. Math. Lett., 2002
2001
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.
Eur. J. Comb., 2001
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles.
Comb. Probab. Comput., 2001
A note on list improper coloring planar graphs.
Appl. Math. Lett., 2001
The 4-choosability of planar graphs without 6-cycles.
Australas. J Comb., 2001
1999
Upper Bounds of Entire Chromatic Number of Plane Graphs.
Eur. J. Comb., 1999
1998
Edge-face chromatic number of plane graphs with high maximum degree.
Australas. J Comb., 1998
1996
On the vertex face total chromatic number of planar graphs.
J. Graph Theory, 1996
1995
On the colorings of outerplanar graphs.
Discret. Math., 1995
