| Publication | Date of Publication | Type |
|---|
The number of spanning trees in 4-regular simple graphs
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Genome galaxy identified by the circular code theory
Bulletin of Mathematical Biology | 2024-12-20 | Paper |
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph
Mathematics of Operations Research | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7731171 (Why is no real title available?) | 2023-08-23 | Paper |
Reading frame retrieval of genes: a new parameter of codon usage based on the circular code theory
Bulletin of Mathematical Biology | 2023-03-07 | Paper |
The minimum number of spanning trees in regular multigraphs
The Electronic Journal of Combinatorics | 2023-01-11 | Paper |
Fractional chromatic number, maximum degree, and girth
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
Bipartite independence number in graphs with bounded maximum degree
SIAM Journal on Discrete Mathematics | 2021-06-10 | Paper |
On fractional fragility rates of graph classes
The Electronic Journal of Combinatorics | 2020-10-20 | Paper |
A 4-choosable graph that is not \((8:2)\)-choosable
Advances in Combinatorics | 2020-10-20 | Paper |
The relation between \(k\)-circularity and circularity of codes
Bulletin of Mathematical Biology | 2020-08-27 | Paper |
Eccentricity of networks with structural constraints
Discussiones Mathematicae Graph Theory | 2020-08-26 | Paper |
| An algorithmic framework for colouring locally sparse graphs | 2020-04-15 | Paper |
| Graph structure via local occupancy | 2020-03-31 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Mixed circular codes
Mathematical Biosciences | 2020-02-17 | Paper |
Variations on the Petersen colouring conjecture
The Electronic Journal of Combinatorics | 2020-01-17 | Paper |
Variations on the Petersen colouring conjecture
The Electronic Journal of Combinatorics | 2020-01-17 | Paper |
Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) | 2019-10-15 | Paper |
On generalized choice and coloring numbers
The Electronic Journal of Combinatorics | 2019-03-22 | Paper |
Extension from precoloured sets of edges
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Extension from precoloured sets of edges
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Expander graphs and sieving in combinatorial structures
Journal of the Australian Mathematical Society | 2018-07-11 | Paper |
Equitable colorings of \(K_4\)-minor-free graphs
Journal of Graph Algorithms and Applications | 2017-10-24 | Paper |
Limits of order types
(available as arXiv preprint) | 2017-10-10 | Paper |
Do triangle-free planar graphs have exponentially many 3-colorings?
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Do triangle-free planar graphs have exponentially many 3-colorings?
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
A note on acyclic vertex-colorings
Journal of Combinatorics | 2016-11-22 | Paper |
| Closeness Centralization Measure for Two-mode Data of Prescribed Sizes | 2016-08-14 | Paper |
Fractional coloring of triangle-free planar graphs
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Fractional coloring of triangle-free planar graphs
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Toward more localized local algorithms, removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Supersaturation in the Boolean lattice | 2015-07-09 | Paper |
Supersaturation in the Boolean lattice
(available as arXiv preprint) | 2015-07-09 | Paper |
Two-floor buildings need eight colors
Journal of Graph Algorithms and Applications | 2015-01-27 | Paper |
Collaborative search on the plane without communication
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Collaborative search on the plane without communication
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Extensions of fractional precolorings show discontinuous behavior
Journal of Graph Theory | 2014-11-17 | Paper |
Extensions of fractional precolorings show discontinuous behavior
Journal of Graph Theory | 2014-11-17 | Paper |
Randomly colouring graphs (a combinatorial view)
Computer Science Review | 2014-10-07 | Paper |
Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
Journal of the London Mathematical Society | 2014-07-28 | Paper |
Transversals of Longest Paths and Cycles
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
| scientific article; zbMATH DE number 6303034 (Why is no real title available?) | 2014-06-11 | Paper |
Toward more localized local algorithms: removing assumptions concerning global knowledge
Distributed Computing | 2014-03-28 | Paper |
A tight bound on the set chromatic number
Discussiones Mathematicae. Graph Theory | 2013-11-11 | Paper |
Circular edge-colorings of cubic graphs with girth six
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Multiple Petersen subdivisions in permutation graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Multiple Petersen subdivisions in permutation graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
A new bound for the 2/3 conjecture
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
Min-max relations for odd cycles in planar graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
A new lower bound based on Gromov's method of selecting heavily covered points
Discrete & Computational Geometry | 2012-09-19 | Paper |
Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Every plane graph of maximum degree 8 has an edge-face 9-coloring
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Characterization of graphs and digraphs with small process numbers
Discrete Applied Mathematics | 2011-08-10 | Paper |
Equitable coloring of sparse planar graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Edge-face coloring of plane graphs with maximum degree nine
Journal of Graph Theory | 2011-04-19 | Paper |
The last fraction of a fractional conjecture
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Graphs with four boundary vertices
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Graphs with four boundary vertices
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The fractional chromatic number of Zykov products of graphs
Applied Mathematics Letters | 2011-01-20 | Paper |
Improper coloring of unit disk graphs
Networks | 2010-11-24 | Paper |
Graphs with bounded tree-width and large odd-girth are almost bipartite
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
A new lower bound on the number of perfect matchings in cubic graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
| scientific article; zbMATH DE number 5764899 (Why is no real title available?) | 2010-08-06 | Paper |
| Improper colouring of (random) unit disk graphs | 2010-07-30 | Paper |
Circular edge-colorings of cubic graphs with girth six
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Facial colorings using Hall's theorem
European Journal of Combinatorics | 2010-04-27 | Paper |
On the sextet polynomial of fullerenes
Journal of Mathematical Chemistry | 2010-04-26 | Paper |
Identifying and locating-dominating codes in (random) geometric networks
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs
Canadian Journal of Mathematics | 2010-03-31 | Paper |
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
Discrete Mathematics | 2010-03-29 | Paper |
Circular choosability
Journal of Graph Theory | 2009-12-18 | Paper |
A note on antisymmetric flows in graphs
European Journal of Combinatorics | 2009-12-01 | Paper |
Total-Coloring of Plane Graphs with Maximum Degree Nine
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Fullerene graphs have exponentially many perfect matchings
Journal of Mathematical Chemistry | 2009-09-02 | Paper |
Long cycles in fullerene graphs
Journal of Mathematical Chemistry | 2009-09-02 | Paper |
3-Facial Coloring of Plane Graphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
| About a Brooks-type theorem for improper colouring | 2009-03-16 | Paper |
List colorings with measurable sets
Journal of Graph Theory | 2009-02-20 | Paper |
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
Discrete Mathematics | 2009-01-28 | Paper |
Projective, affine, and abelian colorings of cubic graphs
European Journal of Combinatorics | 2009-01-27 | Paper |
| Orders with ten elements are circle order | 2009-01-26 | Paper |
| Orders with ten elements are circle order | 2009-01-26 | Paper |
Graphs with full rank 3-color matrix and few 3-colorings
Journal of Combinatorial Theory. Series B | 2008-10-07 | Paper |
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Characterization of affine Steiner triple systems and Hall triple systems
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Improper colouring of (random) unit disk graphs
Discrete Mathematics | 2008-03-18 | Paper |
Pathwidth of outerplanar graphs
Journal of Graph Theory | 2007-06-11 | Paper |
Two proofs of Bermond-Thomassen conjecture for regular tournaments
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Improper Colourings of Unit Disk Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Improper choosability of graphs and maximum average degree
Journal of Graph Theory | 2006-09-06 | Paper |
| scientific article; zbMATH DE number 2157476 (Why is no real title available?) | 2005-04-15 | Paper |
