DOIAbstract
AbstractWe show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete
AbstractWe show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete
We continue research into a well-studied family of problems that ask if the vertices of a graph can ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
AbstractWe show that the problem of deciding whether a connected bipartite graph of degree at most 4...
AbstractWe show that the problem of deciding whether a given planar graph (complete with planar embe...
AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In...
AbstractA graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G i...
We consider 1) the problem of finding in parallel a Maximum Bipartite Subgraph of a cubic graph G(V,...
A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k...
International audienceWe present new complexity results for the Balanced Connected Subgraph (BCS) pr...
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the verte...
We prove the $\mathrm{NP}$-hardness of deciding whether a connected bridgeless cubic graph $G(V, E)$...
A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such hypercube ...
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.A biclique in a b...
AbstractA graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G i...
We continue research into a well-studied family of problems that ask if the vertices of a graph can ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
AbstractWe show that the problem of deciding whether a connected bipartite graph of degree at most 4...
AbstractWe show that the problem of deciding whether a given planar graph (complete with planar embe...
AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In...
AbstractA graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G i...
We consider 1) the problem of finding in parallel a Maximum Bipartite Subgraph of a cubic graph G(V,...
A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k...
International audienceWe present new complexity results for the Balanced Connected Subgraph (BCS) pr...
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the verte...
We prove the $\mathrm{NP}$-hardness of deciding whether a connected bridgeless cubic graph $G(V, E)$...
A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such hypercube ...
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.A biclique in a b...
AbstractA graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G i...
We continue research into a well-studied family of problems that ask if the vertices of a graph can ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
Add to ORKG