| Publication | Date of Publication | Type |
|---|
DP-4-coloring for one class of planar graphs
Advances in Mathematics (Beijing) | 2026-03-16 | Paper |
Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
Discrete Mathematics | 2024-04-30 | Paper |
On the Alon-Tarsi number of semi-strong product of graphs
Journal of Combinatorial Optimization | 2024-01-22 | Paper |
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
Graphs and Combinatorics | 2023-11-29 | Paper |
| Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable | 2023-11-29 | Paper |
A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
Graphs and Combinatorics | 2023-10-31 | Paper |
Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
Applied Mathematics and Computation | 2023-06-29 | Paper |
Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
Information Processing Letters | 2022-10-28 | Paper |
Every planar graph with girth at least 5 is \((1,9)\)-colorable
Discrete Mathematics | 2022-04-11 | Paper |
DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
Discrete Mathematics | 2022-02-14 | Paper |
Planar graphs without 4-cycles and intersecting triangles are \(( 1 , 1 , 0 )\)-colorable
Discrete Applied Mathematics | 2021-09-30 | Paper |
Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2021-04-27 | Paper |
DP-4-colorability of planar graphs without adjacent cycles of given length
Discrete Applied Mathematics | 2020-03-23 | Paper |
Strong edge-coloring of pseudo-Halin graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2020-02-25 | Paper |
Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
Discrete Mathematics | 2019-12-17 | Paper |
Every planar graph without adjacent cycles of length at most 8 is 3-choosable
European Journal of Combinatorics | 2019-08-30 | Paper |
Zero-sum 6-flows in 5-regular graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2019-08-13 | Paper |
Nowhere-zero flows on signed wheels and signed fans
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2019-01-31 | Paper |
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
Discrete Mathematics | 2019-01-22 | Paper |
A relaxation of the strong Bordeaux Conjecture
Journal of Graph Theory | 2018-07-13 | Paper |
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
Discrete Mathematics | 2017-12-20 | Paper |
On strong edge-coloring of graphs with maximum degree 4
Discrete Applied Mathematics | 2017-12-06 | Paper |
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
Journal of Combinatorial Optimization | 2017-08-03 | Paper |
\(Z_3\)-connectivity of claw-free graphs
Graphs and Combinatorics | 2017-06-29 | Paper |
\(Z_3\)-connectivity of \(K_{1,3}\)-free graphs without induced cycle of length at least 5
Ars Mathematica Contemporanea | 2016-12-02 | Paper |
Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity
Frontiers of Mathematics in China | 2016-11-02 | Paper |
Maximum degree of 3-independent vertices and group connectivity.
Ars Combinatoria | 2016-10-26 | Paper |
Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs
Discrete Mathematics | 2016-06-20 | Paper |
Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms
Ars Mathematica Contemporanea | 2016-06-01 | Paper |
\(Z_3\)-connectivity with independent number 2
Graphs and Combinatorics | 2016-03-02 | Paper |
\(Z_3\)-connectivity of wreath product of graphs
Graphs and Combinatorics | 2015-12-17 | Paper |
Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
Discrete Mathematics | 2015-12-08 | Paper |
Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
Frontiers of Mathematics in China | 2015-11-19 | Paper |
Group chromatic number of Halin graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
Collapsible graphs and Hamilton cycles of line graphs
Discrete Applied Mathematics | 2015-09-01 | Paper |
Nowhere-zero 3-flows in semistrong product of graphs
Discrete Mathematics | 2015-08-05 | Paper |
Group connectivity and matchings
Graphs and Combinatorics | 2015-07-20 | Paper |
Group connectivity in \(J_3\) line graphs
Graphs and Combinatorics | 2015-07-20 | Paper |
A relaxation of the Bordeaux conjecture
European Journal of Combinatorics | 2015-06-18 | Paper |
| scientific article; zbMATH DE number 6391575 (Why is no real title available?) | 2015-01-27 | Paper |
Maximum degree condition and group connectivity
Graphs and Combinatorics | 2014-09-19 | Paper |
Nowhere-zero 3-flows of claw-free graphs
Discrete Mathematics | 2014-09-04 | Paper |
Realizing degree sequences as \(Z_3\)-connected graphs
Discrete Mathematics | 2014-08-21 | Paper |
The Chvátal-Erdős condition for group connectivity in graphs
Graphs and Combinatorics | 2014-06-16 | Paper |
Neighborhood unions and \(Z_3\)-connectivity in graphs
Graphs and Combinatorics | 2014-02-14 | Paper |
Degree sum of 3 independent vertices and \(Z_3\)-connectivity
Discrete Mathematics | 2014-01-20 | Paper |
Group connectivity of semistrong product of graphs
The Australasian Journal of Combinatorics | 2013-09-26 | Paper |
Group connectivity of bridged graphs
Graphs and Combinatorics | 2013-07-19 | Paper |
The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
Journal of Combinatorial Optimization | 2013-06-13 | Paper |
Spanning Eulerian subgraphs of 2-edge-connected graphs
Graphs and Combinatorics | 2013-05-13 | Paper |
Nowhere-zero \(3\)-flows in dihedral Cayley graphs
Information Processing Letters | 2013-03-28 | Paper |
Group connectivity in 3-edge-connected graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Labeling outerplanar graphs with maximum degree three
Discrete Applied Mathematics | 2012-11-22 | Paper |
A note on spanning Eulerian graphs.
Ars Combinatoria | 2012-10-08 | Paper |
Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
Discrete Mathematics | 2012-08-10 | Paper |
Degree condition and \(Z_3\)-connectivity
Discrete Mathematics | 2012-05-30 | Paper |
Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs
Applied Mathematics Letters | 2011-06-28 | Paper |
Group connectivity and group colorings of graphs --- a survey
Acta Mathematica Sinica, English Series | 2011-04-06 | Paper |
Small cycle covers of 3-connected cubic graphs
Discrete Mathematics | 2011-01-07 | Paper |
Degree sum condition for \(Z_{3}\)-connectivity in graphs
Discrete Mathematics | 2010-10-28 | Paper |
| scientific article; zbMATH DE number 5732878 (Why is no real title available?) | 2010-07-08 | Paper |
Optimal radio labellings of complete \(m\)-ary trees
Discrete Applied Mathematics | 2010-05-05 | Paper |
Degree conditions for group connectivity
Discrete Mathematics | 2010-04-27 | Paper |
| Connected graph searching for unicyclic graphs | 2010-03-31 | Paper |
On 3-choosable planar graphs of girth at least 4
Discrete Mathematics | 2009-06-19 | Paper |
A constructive characterization of total domination vertex critical graphs
Discrete Mathematics | 2009-04-09 | Paper |
An inequality for the group chromatic number of a graph
Discrete Mathematics | 2007-11-30 | Paper |
On group chromatic number of graphs
Graphs and Combinatorics | 2006-06-16 | Paper |
Group chromatic number of planar graphs of girth at least 4
Journal of Graph Theory | 2006-06-06 | Paper |
| scientific article; zbMATH DE number 2192150 (Why is no real title available?) | 2005-08-04 | Paper |
Nowhere zero 4‐flow in regular matroids
Journal of Graph Theory | 2005-08-01 | Paper |
Spanning trails connecting given edges
Graphs and Combinatorics | 2005-05-12 | Paper |
Small cycle cover of 2-connected cubic graphs
Discrete Mathematics | 2003-08-19 | Paper |
Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
Journal of Graph Theory | 2003-05-11 | Paper |
Hamilton cycles in 1-tough triangle-free graphs
Discrete Mathematics | 2002-08-29 | Paper |
Super-Eulerian graphs of minimum degree at least \(4\).
Advances in Mathematics (Beijing) | 2002-01-29 | Paper |
A degree condition of 2-factors in bipartite graphs
Discrete Applied Mathematics | 2002-01-08 | Paper |
A neighborhood union condition for pancyclic graphs
Systems Science and Mathematical Sciences | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1559164 (Why is no real title available?) | 2001-01-31 | Paper |
| scientific article; zbMATH DE number 1382413 (Why is no real title available?) | 2000-02-27 | Paper |
| scientific article; zbMATH DE number 1187419 (Why is no real title available?) | 1999-03-07 | Paper |
| scientific article; zbMATH DE number 1086005 (Why is no real title available?) | 1998-05-06 | Paper |
