| Publication | Date of Publication | Type |
|---|
A note on 2-quasi-bisection of cubic graphs with oddness 2
Discrete Mathematics | 2026-02-16 | Paper |
An infinite family of normal 5-edge colorable superpositioned snarks
Discrete Applied Mathematics | 2025-11-04 | Paper |
Modulo flows and integer flows in signed graphs
Journal of Graph Theory | 2025-08-25 | Paper |
Research on dynamic pricing and coordination model of fresh produce supply chain based on differential game considering traceability goodwill
RAIRO. Operations Research | 2025-01-08 | Paper |
On abelian one-dimensional hull codes in group algebras
Designs, Codes and Cryptography | 2024-12-11 | Paper |
Six-flows of signed graphs with frustration index three
Discrete Mathematics | 2024-12-02 | Paper |
Five-cycle double cover and shortest cycle cover
Journal of Graph Theory | 2024-11-24 | Paper |
Subfield codes of several few-weight linear codes parameterized by functions and their consequences
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Estimation of production technologies with output and environmental constraints
International Economic Review | 2024-07-15 | Paper |
Alternative tests for the significance of the intraclass correlation coefficients under unequal family sizes
Communications in Statistics. Simulation and Computation | 2024-05-28 | Paper |
| Signed circuit $6$-covers of signed $K_4$-minor-free graphs | 2023-10-25 | Paper |
| Integer flows on triangularly connected signed graphs | 2023-10-20 | Paper |
The average degree of edge chromatic critical graphs with maximum degree seven
Journal of Graph Theory | 2023-10-12 | Paper |
Decomposition of class II graphs into two class I graphs
Discrete Mathematics | 2023-10-04 | Paper |
5-Cycle Double Covers, 4-Flows, and Catlin Reduction
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
Discrete Applied Mathematics | 2023-02-24 | Paper |
Two families of optimal ternary cyclic codes with minimal distance four
Finite Fields and their Applications | 2022-03-03 | Paper |
Flows on flow-admissible signed graphs
Journal of Combinatorial Theory. Series B | 2021-06-18 | Paper |
Integer flows and modulo orientations of signed graphs
SIAM Journal on Discrete Mathematics | 2021-03-17 | Paper |
Flows on signed graphs without long barbells
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
Edge coloring of signed graphs
Discrete Applied Mathematics | 2020-06-05 | Paper |
Upper bounds on the maximum degree of class two graphs on surfaces
Discrete Mathematics | 2020-01-22 | Paper |
Upper bounds on list star chromatic index of sparse graphs
Acta Mathematica Sinica, English Series | 2020-01-21 | Paper |
List star edge coloring of \(k\)-degenerate graphs
Discrete Mathematics | 2019-06-27 | Paper |
Shortest circuit covers of signed graphs
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
Flow-contractible configurations and group connectivity of signed graphs
Discrete Mathematics | 2018-09-21 | Paper |
Cyclic codes over \(M_{2}(\mathbb {F}_{2}+u\mathbb {F}_{2})\)
Cryptography and Communications | 2018-08-28 | Paper |
Neighbor sum distinguishing total coloring of graphs with bounded treewidth
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Signed graphs: from modulo flows to integer-valued flows
SIAM Journal on Discrete Mathematics | 2018-04-27 | Paper |
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
Discrete Applied Mathematics | 2018-02-22 | Paper |
\(r\)-hued coloring of sparse graphs
Discrete Applied Mathematics | 2018-02-22 | Paper |
Multiple weak 2-linkage and its applications on integer flows of signed graphs
European Journal of Combinatorics | 2017-12-21 | Paper |
Neighbor sum distinguishing index of 2-degenerate graphs
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
Nowhere-zero 3-flow of graphs with small independence number
Discrete Mathematics | 2017-10-24 | Paper |
Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
Graphs and Combinatorics | 2017-10-11 | Paper |
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
SIAM Journal on Discrete Mathematics | 2017-08-31 | Paper |
Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
Discrete Mathematics | 2016-12-14 | Paper |
Hamiltonian cycles in critical graphs with large maximum degree
Graphs and Combinatorics | 2016-11-29 | Paper |
Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\)
Journal of Graph Theory | 2016-11-16 | Paper |
| Integer flows and orientations | 2016-09-30 | Paper |
A note on the size of edge-chromatic 4-critical graphs
Discrete Mathematics | 2016-06-16 | Paper |
Adjacent vertex distinguishing total colorings of 2-degenerate graphs
Discrete Mathematics | 2016-06-16 | Paper |
Extendability of contractible configurations for nowhere-zero flows and modulo orientations
Graphs and Combinatorics | 2016-06-09 | Paper |
Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Vector flows and integer flows
SIAM Journal on Discrete Mathematics | 2015-11-18 | Paper |
Laplacian energy of digraphs and a minimum Laplacian energy algorithm
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Neighbor sum distinguishing edge colorings of sparse graphs
Discrete Applied Mathematics | 2015-07-24 | Paper |
Graphic sequences with an \(A\)-connected realization
Graphs and Combinatorics | 2015-01-20 | Paper |
Strong list edge coloring of subcubic graphs
Mathematical Problems in Engineering | 2014-10-13 | Paper |
A note on an extremal problem for group-connectivity
European Journal of Combinatorics | 2014-08-28 | Paper |
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
European Journal of Combinatorics | 2014-03-25 | Paper |
Nowhere-zero 3-flows of graphs with independence number two
Graphs and Combinatorics | 2014-02-14 | Paper |
A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
Journal of Graph Theory | 2013-07-31 | Paper |
The first three largest Randić indices of unicyclic graphs
MATCH - Communications in Mathematical and in Computer Chemistry | 2012-09-21 | Paper |
An extremal problem on group connectivity of graphs
European Journal of Combinatorics | 2012-06-18 | Paper |
A new upper bound for the independence number of edge chromatic critical graphs
Journal of Graph Theory | 2011-11-15 | Paper |
Finding \(\Delta(\Sigma )\) for a surface \(\Sigma\) of characteristic \(\chi(\Sigma) = -5\)
Journal of Graph Theory | 2011-10-12 | Paper |
Equitable coloring of sparse planar graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
Discrete Mathematics | 2009-12-09 | Paper |
| PFP-modules and \(H\)-finitely generated modules. | 2009-11-11 | Paper |
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures
Discrete Applied Mathematics | 2009-06-30 | Paper |
On sharp bounds of the zero-order Randić index of certain unicyclic graphs
Applied Mathematics Letters | 2009-06-09 | Paper |
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
The size of edge chromatic critical graphs with maximum degree 6
Journal of Graph Theory | 2009-02-20 | Paper |
When are torsionless modules projective?
Journal of Algebra | 2008-10-22 | Paper |
A sharp lower bound of the Randić index of cacti with \(r\) pendants
Discrete Applied Mathematics | 2008-09-10 | Paper |
Ore-condition and \(Z_3\)-connectivity
European Journal of Combinatorics | 2008-09-04 | Paper |
Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
Non-bipartite graphs with third largest Laplacian eigenvalue less than three
Acta Mathematica Sinica, English Series | 2006-10-13 | Paper |
A note on Vizing's independence number conjecture of edge chromatic critical graphs
Discrete Mathematics | 2006-09-13 | Paper |
A note on class one graphs with maximum degree six
Discrete Mathematics | 2006-08-04 | Paper |
| scientific article; zbMATH DE number 2230302 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2221185 (Why is no real title available?) | 2005-10-31 | Paper |
Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
Combinatorica | 2005-10-04 | Paper |
| scientific article; zbMATH DE number 2192193 (Why is no real title available?) | 2005-08-04 | Paper |
Edge‐face chromatic number and edge chromatic number of simple plane graphs
Journal of Graph Theory | 2005-08-01 | Paper |
| scientific article; zbMATH DE number 2188455 (Why is no real title available?) | 2005-07-26 | Paper |
On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
European Journal of Combinatorics | 2005-03-08 | Paper |
Edge coloring of graphs with small average degrees
Discrete Mathematics | 2004-02-02 | Paper |
Edge coloring of embedded graphs with large girth
Graphs and Combinatorics | 2003-10-16 | Paper |
Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices
Czechoslovak Mathematical Journal | 2003-03-31 | Paper |
| scientific article; zbMATH DE number 1833074 (Why is no real title available?) | 2003-03-26 | Paper |
The Laplacian eigenvalues of mixed graphs
Linear Algebra and its Applications | 2003-03-11 | Paper |
| scientific article; zbMATH DE number 1293748 (Why is no real title available?) | 1999-07-12 | Paper |
The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
Science in China. Series A | 1999-02-01 | Paper |
WITHDRAWN: A note on strong edge-colorings of 2-degenerate graphs
(available as arXiv preprint) | N/A | Paper |
An 8-flow theorem for signed graphs
(available as arXiv preprint) | N/A | Paper |
