Pages that link to "Item:Q1123898"

The following pages link to On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (Q1123898):

Displaying 50 items.

• On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
• A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
• A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
• Corrigendum to ``Cycle transversals in perfect graphs and cographs'' (Q387014) (← links)
• Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
• On finding orientations with the fewest number of vertices with small out-degree (Q494438) (← links)
• On feedback vertex set: new measure and new structures (Q494933) (← links)
• A simple proof of an inequality connecting the alternating number of independent sets and the decycling number (Q539877) (← links)
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• On the maximum induced forests of a connected cubic graph without triangles (Q757394) (← links)
• A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
• Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685) (← links)
• Some observations on holographic algorithms (Q1616615) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
• The cyclomatic number of a graph and its independence polynomial at \(- 1\) (Q1950412) (← links)
• (In)approximability of maximum minimal FVS (Q2051849) (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) (← links)
• On reconfigurability of target sets (Q2110378) (← links)
• The size of graphs with given feedback vertex number (Q2127624) (← links)
• Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
• Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
• Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
• Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
• On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
• Dominating and large induced trees in regular graphs (Q2463903) (← links)
• Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
• Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
• On feedback vertex sets and nonseparating independent sets in cubic graphs (Q3804730) (← links)
• (Q5009469) (← links)
• Acyclic polynomials of graphs (Q5080911) (← links)
• Decycling bipartite graphs (Q5084689) (← links)
• A naive algorithm for feedback vertex set (Q5240414) (← links)
• (Q5708559) (← links)
• On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
• Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
• Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
• A bound on the dissociation number (Q6047956) (← links)
• Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
• Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
• Eternal connected vertex cover problem in graphs: complexity and algorithms (Q6547830) (← links)
• On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
• Splitting plane graphs to outerplanarity (Q6636997) (← links)