Îçҹ̽»¨

Balanced edge-labelings in graphs and related concepts (Dissertation)

Mostar index and bounded maximum degree

Vertex degrees close to the average degree

Bounding the Mostar index

Maximizing the Mostar index for bipartite graphs and split graphs ,

Majority Edge-Colorings of Graphs ,

Relating the independence number and the dissociation number ,

A bound on the dissociation number ,

Relating dissociation, independence, and matchings ,

Diameter, edge-connectivity, and C4-freeness ,

Factorially many maximum matchings close to the ErdÅ‘s-Gallai bound ,

Unbalanced spanning subgraphs in edge labeled complete graphs ,

Almost color-balanced perfect matchings in color-balanced complete graphs ,

Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation ,

Zero-sum copies of spanning forests in zero-sum complete graphs ,

Exponential Independence in Subcubic Graphs ,