In this paper, we proved that the problem of finding maximum sparse k -regular induced subgraphs can be solved in the class of 2 P 3 -free graphs in polynomial ...
We show that for each fixed k, the problem of finding a maximum k-regular induced subgraph in a 2P3-free graph can be solved in polynomial time.
These problems are generally NP-hard. On the other hand, each of them may become polynomially solvable when restricted to graphs in special classes. However, ...
regular induced subgraphs in 2P3-free graphs was studied in [11]. This paper observed a fundamental difference between finding sparse and dense graphs in ...
Sparse regular induced subgraphs in 2P3-free graphs. Let us repeat that graphs are sparse regular if they are k-regular for a constant k. The problem of ...
Sparse regular induced subgraphs in 2P3-free graphs. VV Lozin, R Mosca, C Purcell. Discrete Optimization 10 (4), 304-309, 2013. 5, 2013. Coloring vertices of ...
Jun 15, 2021 · For an integer t, a graph G is called C>t-free if G does not contain any induced cycle on more than t vertices.
Sparse regular induced subgraphs in 2P3-free graphs. VV Lozin, R Mosca, C Purcell. Discrete Optimization 10 (4), 304-309, 2013. 5, 2013. Role colouring graphs ...
Jul 14, 2023 · We prove that a number of computational problems that ask for the largest sparse induced subgraph satisfying some property definable in CMSO2 logic
Missing: 2P3- | Show results with:2P3-
Lozin, Vadim V., Mosca, Raffaele and Purcell, Christopher (2013) Sparse regular induced subgraphs in 2P3-free graphs. Discrete Optimization, Volume 10 ...