Johannes Pardey

Available identifiers

Publication	Date of Publication	Type
Mostar index and bounded maximum degree	2025-01-23	Paper
Bounding the Mostar index	2023-10-30	Paper
A bound on the dissociation number	2023-10-10	Paper
Relating the independence number and the dissociation number	2023-10-09	Paper
Vertex degrees close to the average degree	2023-10-04	Paper
Maximizing the Mostar index for bipartite graphs and split graphs	2023-06-30	Paper
Mostar index and bounded maximum degree	2023-06-15	Paper
Majority edge-colorings of graphs	2023-03-21	Paper
Unbalanced spanning subgraphs in edge labeled complete graphs	2023-03-21	Paper
Diameter, edge-connectivity, and $C_4$-freeness	2023-03-10	Paper
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation	2023-02-22	Paper
Relating dissociation, independence, and matchings	2022-10-13	Paper
Zero-sum copies of spanning forests in zero-sum complete graphs	2022-08-08	Paper
Factorially many maximum matchings close to the Erdős-Gallai bound	2022-07-11	Paper
Majority Edge-Colorings of Graphs	2022-05-23	Paper
Diameter, edge-connectivity, and $C_4$-freeness	2021-12-16	Paper
Almost color-balanced perfect matchings in color-balanced complete graphs	2021-11-23	Paper
Unbalanced spanning subgraphs in edge labeled complete graphs	2021-07-20	Paper
Exponential independence in subcubic graphs	2021-06-14	Paper
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation	2021-02-22	Paper

This page was built for person: Johannes Pardey