J. P. Costalonga

activity

20122021

collaborators

4 papers

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 $3$ -connected graphs with no pair of vertex-disjoint cycles. Equivalently, they characterized all $3$ -connected graphs with no pris…

math.CO2021

Constructing minimally 3-connected graphs

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

A $3$ -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…

math.CO2013

On $K_{5}$ and $K_{3, 3}$ -minors of graphs and regular matroids

João Paulo Costalonga

In this paper we prove two main results about obstruction to graph planarity. One is that, if $G$ is a 3-connected graph with a $K_{5}$ -minor and $T$ is a triangle of $G$ , then $G$ h…

math.CO2012

Non-Separating Cocircuits and Graphicness in Matroids