| Publication | Date of Publication | Type |
|---|
Cliques in squares of graphs with maximum average degree less than 4
Journal of Graph Theory | 2024-11-24 | Paper |
A new connectivity bound for a tournament to be highly linked
| 2023-11-07 | Paper |
On the irregularity of uniform hypergraphs
Linear Algebra and its Applications | 2023-10-31 | Paper |
Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs
Journal of Graph Theory | 2023-10-05 | Paper |
Strong edge-coloring of 2-degenerate graphs
Discrete Applied Mathematics | 2023-06-05 | Paper |
1-planar graphs are odd 13-colorable
Discrete Mathematics | 2023-05-31 | Paper |
Toughness and the existence of $k$-factors in hypergraphs
| 2023-04-27 | Paper |
Optimal connectivity for fat-triangle linkages
Discrete Mathematics | 2023-03-10 | Paper |
Spanning tree packing and 2-essential edge-connectivity
Discrete Mathematics | 2022-11-02 | Paper |
Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
Discrete Mathematics | 2022-02-14 | Paper |
Note on injective edge-coloring of graphs
Discrete Applied Mathematics | 2022-02-09 | Paper |
Open locating-dominating sets in circulant graphs
Discussiones Mathematicae Graph Theory | 2022-01-03 | Paper |
Sufficient conditions for 2-dimensional global rigidity
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
Disjoint chorded cycles in graphs with high Ore-degree
| 2021-10-04 | Paper |
Planar graphs without 4-cycles and intersecting triangles are \(( 1 , 1 , 0 )\)-colorable
Discrete Applied Mathematics | 2021-09-30 | Paper |
An improved linear connectivity bound for tournaments to be highly linked
European Journal of Combinatorics | 2021-09-02 | Paper |
Enhancing the Erd\H{o}s-Lov\'asz Tihany Conjecture for graphs with independence number two
| 2020-08-18 | Paper |
Planar graphs without short even cycles are near-bipartite
Discrete Applied Mathematics | 2020-07-07 | Paper |
Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
Planar graphs without 7-cycles and butterflies are DP-4-colorable
Discrete Mathematics | 2020-06-08 | Paper |
DP-4-colorability of planar graphs without adjacent cycles of given length
Discrete Applied Mathematics | 2020-03-23 | Paper |
The strong edge-coloring for graphs with small edge weight
Discrete Mathematics | 2020-02-20 | 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 |
Recent progress on strong edge-coloring of graphs
Discrete Mathematics, Algorithms and Applications | 2019-11-07 | Paper |
Planar graphs with girth at least 5 are \((3, 4)\)-colorable
Discrete Mathematics | 2019-10-17 | Paper |
DP-4-colorability of two classes of planar graphs
Discrete Mathematics | 2019-09-11 | Paper |
Minimum degree condition for a graph to be knitted
Discrete Mathematics | 2019-09-11 | Paper |
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Discrete Mathematics | 2019-08-20 | Paper |
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
Graphs and Combinatorics | 2019-06-28 | Paper |
Fat-triangle linkage and kite-linked graphs
| 2019-06-21 | Paper |
Strong edge-coloring for planar graphs with large girth
Discrete Mathematics | 2018-11-29 | Paper |
DP-3-coloring of some planar graphs
Discrete Mathematics | 2018-11-13 | Paper |
Strong list-chromatic index of subcubic graphs
Discrete Mathematics | 2018-10-23 | Paper |
DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$
| 2018-09-19 | Paper |
Strong chromatic index of graphs with maximum degree four
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Covering 2-connected 3-regular graphs with disjoint paths
Journal of Graph Theory | 2018-08-16 | Paper |
Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
A relaxation of the strong Bordeaux Conjecture
Journal of Graph Theory | 2018-07-13 | Paper |
On strong edge-coloring of graphs with maximum degree 4
Discrete Applied Mathematics | 2017-12-06 | Paper |
A note on chromatic number and induced odd cycles
The Electronic Journal of Combinatorics | 2017-11-10 | 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 |
Maximum average degree and relaxed coloring
Discrete Mathematics | 2017-08-01 | Paper |
The strong chromatic index of \((3,\Delta)\)-bipartite graphs
Discrete Mathematics | 2017-02-27 | Paper |
Extremal permutations in routing cycles
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
Information Processing Letters | 2016-07-27 | Paper |
Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
Discrete Mathematics | 2015-12-08 | Paper |
Strong edge-colorings for \(k\)-degenerate graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
Optimal open-locating-dominating sets in infinite triangular grids
Discrete Applied Mathematics | 2015-07-24 | Paper |
A relaxation of the Bordeaux conjecture
European Journal of Combinatorics | 2015-06-18 | Paper |
Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
Journal of Combinatorial Theory. Series B | 2014-10-06 | Paper |
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
Discrete Applied Mathematics | 2014-04-23 | Paper |
Linear colorings of subcubic graphs
European Journal of Combinatorics | 2014-04-11 | Paper |
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
Discrete Mathematics | 2014-01-23 | Paper |
A relaxation of Steinberg's conjecture
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Graphs containing every 2-factor
Graphs and Combinatorics | 2012-12-27 | Paper |
Perfect partition of some regular bipartite graphs
| 2012-12-25 | Paper |
Linkage for the diamond and the path with four vertices
Journal of Graph Theory | 2012-07-10 | Paper |
An extremal problem on group connectivity of graphs
European Journal of Combinatorics | 2012-06-18 | Paper |
Equitable defective coloring of sparse planar graphs
Discrete Mathematics | 2012-03-16 | Paper |
Permutations as Product of Parallel Transpositions
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Linear choosability of sparse graphs
Discrete Mathematics | 2011-08-09 | Paper |
Equitable coloring of sparse planar graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Injective colorings of graphs with low average degree
Algorithmica | 2011-06-30 | Paper |
Injective colorings of sparse graphs
Discrete Mathematics | 2010-10-19 | Paper |
On the pagenumber of \(k\)-trees
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
On a graph packing conjecture by Bollobás, Eldridge and Catlin
Combinatorica | 2010-08-13 | Paper |
On the minimum 2-wide diameter of cycles with chords
| 2010-07-08 | Paper |
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Extremal graph packing problems: Ore-type versus Dirac-type
| 2010-01-13 | Paper |
Ore-type conditions implying 2-factors consisting of short cycles
Discrete Mathematics | 2009-12-15 | Paper |
On the First-Fit Chromatic Number of Graphs
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Hamiltonian connectedness in 3-connected line graphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
Implications among linkage properties in graphs
Journal of Graph Theory | 2009-06-16 | Paper |
M-degrees of quadrangle-free planar graphs
Journal of Graph Theory | 2009-02-20 | Paper |
Packing of graphs with small product of sizes
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
Minimum degree conditions for \(H\)-linked graphs
Discrete Applied Mathematics | 2008-09-29 | Paper |
Ore-condition and \(Z_3\)-connectivity
European Journal of Combinatorics | 2008-09-04 | Paper |
Decomposing a planar graph with girth 9 into a forest and a matching
European Journal of Combinatorics | 2008-05-29 | Paper |
Ore‐type degree conditions for a graph to be H‐linked
Journal of Graph Theory | 2008-05-14 | Paper |
An inequality for the group chromatic number of a graph
Discrete Mathematics | 2007-11-30 | Paper |
On Minimum Degree Implying That a Graph is H‐Linked
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
An Ore-type analogue of the Sauer-Spencer theorem
Graphs and Combinatorics | 2007-10-11 | Paper |
Minimum degree conditions for H-linked graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Ore-type graph packing problems
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
On extremal matrices of second largest exponent by Boolean rank
Linear Algebra and its Applications | 2007-03-09 | Paper |
On Sufficient Degree Conditions for a Graph to be $k$-linked
Combinatorics, Probability and Computing | 2006-12-05 | Paper |
Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
Discrete Mathematics | 2006-03-20 | Paper |
An extremal problem for H‐linked graphs
Journal of Graph Theory | 2005-12-08 | Paper |
On maximal \((k,b)\)-linear-free sets of integers and its spectrum
The Australasian Journal of Combinatorics | 2001-08-30 | Paper |
WITHDRAWN: A note on strong edge-colorings of 2-degenerate graphs
| N/A | Paper |
Cliques in Squares of Graphs with Maximum Average Degree less than 4
| N/A | Paper |
On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
| N/A | Paper |
