Johannes Pardey

Orcid: 0000-0002-4614-9009

According to our database1, Johannes Pardey authored at least 14 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bounding the Mostar index.
Discret. Math., January, 2024

2023
Vertex degrees close to the average degree.
Discret. Math., December, 2023

Relating the independence number and the dissociation number.
J. Graph Theory, October, 2023

A bound on the dissociation number.
J. Graph Theory, August, 2023

Diameter, edge-connectivity, and <i>C</i><sub>4</sub>-freeness.
Discret. Math., May, 2023

Maximizing the Mostar index for bipartite graphs and split graphs.
Discret. Optim., May, 2023

Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation.
Discret. Appl. Math., March, 2023

Majority Edge-Colorings of Graphs.
Electron. J. Comb., 2023

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.
Electron. J. Comb., 2023

2022
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs.
Graphs Comb., 2022

Almost color-balanced perfect matchings in color-balanced complete graphs.
Discret. Math., 2022

Relating dissociation, independence, and matchings.
Discret. Appl. Math., 2022

Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound.
Electron. J. Comb., 2022

2021
Exponential independence in subcubic graphs.
Discret. Math., 2021


  Loading...