Pages that link to "Item:Q3804730"
From MaRDI portal
The following pages link to On feedback vertex sets and nonseparating independent sets in cubic graphs (Q3804730):
Displayed 30 items.
- A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← 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 feedback vertex set: new measure and new structures (Q494933) (← links)
- On the maximum induced forests of a connected cubic graph without triangles (Q757394) (← links)
- Maximum genus and girth of graphs (Q1297489) (← links)
- Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- New formulae for the decycling number of graphs (Q1630929) (← links)
- The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- A new bound on the feedback vertex sets in cubic graphs (Q1910543) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Nonseparating independent sets and maximum genus of graphs (Q2155662) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- Feedback vertex sets in cubic multigraphs (Q2515555) (← links)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)