J. P. Costalonga

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

10 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.CO2017

A Note on Construction of Dual-Hamiltonian Graphs

João Paulo Costalonga

A connected simple graph is said dual-hamiltonian if its vertex set has a $2$ -coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We…

math.CO2017★ 2 cited

Triangle-roundedness in matroids

João Paulo Costalonga, Xianqiang Zhou

A matroid $N$ is said to be triangle-rounded in a class of matroids $M$ if each $3$ -connected matroid $M \in M$ with a triangle $T$ and an $N$ -minor has an $N$ -m…

math.CO2015

Toroidal boards and code covering

João Paulo Costalonga

We denote by $F_{q}$ the field with $q$ elements. A radius- $r$ extended ball with center in a $1$ -dimensional vector subspace $V$ of $F_{q}^{3}$ is the set of elements…

math.CO2015★ 3 cited

Contractible edges in 3-connected graphs that preserve a minor

João Paulo Costalonga

Let $G$ be a $3$ -connected graph with a $3$ -connected (or sufficiently small) simple minor $H$ . We establish that $G$ has a forest $F$ with at least $\left\lceil(|G|-|H|+1)/2\right…

math.CO2014★ 6 cited

A splitter theorem on 3-connected matroids and graphs

João Paulo Costalonga

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$ -connected simple graphs such that $G$ has an $H$ -minor and $k:=|V…

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

João Paulo Costalonga

Let $M$ be a 3-connected binary matroid and let $Y (M)$ be the set of elements of $M$ avoiding at least $r (M) + 1$ non-separating cocircuits of $M$ . Lemos proved that $M$ is non-graph…

math.CO2012★ 1 cited

Vertically N-contractible elements in 3-connected matroids

João Paulo Costalonga

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x \in E (M)$ is vertically $N$ -contractible if $s i (M / x)$ …

Rooted prism-minors and disjoint cycles containing a specified edge

Constructing minimally 3-connected graphs

A Note on Construction of Dual-Hamiltonian Graphs

Triangle-roundedness in matroids

Toroidal boards and code covering

Contractible edges in 3-connected graphs that preserve a minor

A splitter theorem on 3-connected matroids and graphs

On K5​ and K3,3​-minors of graphs and regular matroids

Non-Separating Cocircuits and Graphicness in Matroids

Vertically N-contractible elements in 3-connected matroids

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