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

Showing 2017Show all

2 papers · 1 filter

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…