On feedback vertex sets and nonseparating independent sets in cubic graphs
From MaRDI portal
Publication:3804730
DOI10.1002/jgt.3190120311zbMath0657.05042OpenAlexW1967424311MaRDI QIDQ3804730
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120311
Related Items
Some observations on holographic algorithms ⋮ New formulae for the decycling number of graphs ⋮ A lower bound on the order of the largest induced forest in planar graphs with high girth ⋮ Nonseparating independent sets and maximum genus of graphs ⋮ A new bound on the feedback vertex sets in cubic graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ Boundary classes for graph problems involving non-local properties ⋮ A new formula for the decycling number of regular graphs ⋮ Maximum genus and maximum nonseparating independent set of a 3-regular graph ⋮ A \(9k\) kernel for nonseparating independent set in planar graphs ⋮ Corrigendum to ``Cycle transversals in perfect graphs and cographs ⋮ Deterministic Algorithms for the Independent Feedback Vertex Set Problem ⋮ Feedback vertex set on Hamiltonian graphs ⋮ On the parameterized complexity of the acyclic matching problem ⋮ A bound on the dissociation number ⋮ Feedback vertex set reconfiguration in planar graphs ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Constraint bipartite vertex cover: simpler exact algorithms and implementations ⋮ Computing the differential of a graph: hardness, approximability and exact algorithms ⋮ On feedback vertex set: new measure and new structures ⋮ Dominating and large induced trees in regular graphs ⋮ Approximability of the independent feedback vertex set problem for bipartite graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Feedback vertex sets in cubic multigraphs ⋮ The maximum genus of a 3-regular simplicial graph ⋮ On the maximum induced forests of a connected cubic graph without triangles ⋮ On the complexity of solution extension of optimization problems ⋮ Extension and its price for the connected vertex cover problem ⋮ The integrity of a cubic graph ⋮ Maximum genus and girth of graphs
Cites Work
