Juan José Montellano‐Ballesteros

most cited

k

-colored kernels in semicomplete multipartite digraphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2012★ 1 cited

$k$ -colored kernels in semicomplete multipartite digraphs

Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros

An $m$ -colored digraph $D$ has $k$ -colored kernel if there exists a subset $K$ of its vertices such that for every vertex $v \in / K$ there exists an at most $k$ -colored directed…

math.CO2010

Cubic Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids

Stefan Felsner, Ricardo Gomez, Kolja Knauer +2

We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algori…

k-colored kernels in semicomplete multipartite digraphs

Cubic Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids

$k$ -colored kernels in semicomplete multipartite digraphs