activity
20122021
most citedA splitter theorem on 3-connected matroids and graphs

6 citations · 12 across the 10 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.CO2021

Rooted prism-minors and disjoint cycles containing a specified edge

João Paulo Costalonga, Talmage James Reid, Haindong Wu

Dirac and Lovász independently characterized the -connected graphs with no pair of vertex-disjoint cycles. Equivalently, they characterized all -connected graphs with no pris…

math.CO2021

Constructing minimally 3-connected graphs

J. P. Costalonga, R. J. Kingan, S. R. Kingan

A -connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the re…