AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In this note we establish NP-completeness for the r-regular subgraph problem for each r ⩾ 3 and certain restrictions on G. In particular, the cubic subgraph problem is NP-complete even for the simple case where G is a bipartite planar graph with maximum degree 4
J. Inform. Processing 13, 442-448, 1990This is a survey on complexity issues of subgraph problems pr...
We show that it is NP-hard to determine if a cubic graph G is 1-tough. We then use this result to sh...
We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of...
AbstractWe show that the problem of deciding whether a given planar graph (complete with planar embe...
We design a O(n3) polynomial time algorithm for finding a (k-1)- regular subgraph in a k-regular gra...
AbstractWe show that the problems of deciding (i) whether an arbitrary graph has a k-regular subgrap...
AbstractWe show that the problem of deciding whether a connected bipartite graph of degree at most 4...
abstract. The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k,...
AbstractGiven a graph G=(V,E) and a positive integer k, the partition into cliques (pic) decision pr...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
AbstractThe r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, w...
In this paper, we completely resolve the well-known problem of ErdÅ s and Sauer from 1975 which asks...
In this paper, we prove that there exists a function ρ k = (4+o(1))k such that G(n, ρ/n) contains a ...
AbstractThe problem of deciding whether a 3-regular graph has a hamiltonian cycle (or path) was prov...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
J. Inform. Processing 13, 442-448, 1990This is a survey on complexity issues of subgraph problems pr...
We show that it is NP-hard to determine if a cubic graph G is 1-tough. We then use this result to sh...
We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of...
AbstractWe show that the problem of deciding whether a given planar graph (complete with planar embe...
We design a O(n3) polynomial time algorithm for finding a (k-1)- regular subgraph in a k-regular gra...
AbstractWe show that the problems of deciding (i) whether an arbitrary graph has a k-regular subgrap...
AbstractWe show that the problem of deciding whether a connected bipartite graph of degree at most 4...
abstract. The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k,...
AbstractGiven a graph G=(V,E) and a positive integer k, the partition into cliques (pic) decision pr...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
AbstractThe r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, w...
In this paper, we completely resolve the well-known problem of ErdÅ s and Sauer from 1975 which asks...
In this paper, we prove that there exists a function ρ k = (4+o(1))k such that G(n, ρ/n) contains a ...
AbstractThe problem of deciding whether a 3-regular graph has a hamiltonian cycle (or path) was prov...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
J. Inform. Processing 13, 442-448, 1990This is a survey on complexity issues of subgraph problems pr...
We show that it is NP-hard to determine if a cubic graph G is 1-tough. We then use this result to sh...
We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of...
DOI
Add to ORKG