The following pages link to Johannes Pardey (Q2032858):
Displaying 19 items.
- Exponential independence in subcubic graphs (Q2032859) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
- Zero-sum copies of spanning forests in zero-sum complete graphs (Q2162505) (← links)
- Almost color-balanced perfect matchings in color-balanced complete graphs (Q2666593) (← links)
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation (Q2685699) (← links)
- Diameter, edge-connectivity, and \(C_4\)-freeness (Q2689491) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- Majority edge-colorings of graphs (Q2692181) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- Bounding the Mostar index (Q6080169) (← links)
- Vertex degrees close to the average degree (Q6080552) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
- Maximizing the Mostar index for bipartite graphs and split graphs (Q6108918) (← links)
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation (Q6361266) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q6373249) (← links)
- Diameter, edge-connectivity, and $C_4$-freeness (Q6385870) (← links)
- Majority Edge-Colorings of Graphs (Q6399894) (← links)
- Mostar index and bounded maximum degree (Q6670504) (← links)
