Decycling graphs
From MaRDI portal
Recommendations
Cited in
(64)- Minimum feedback vertex sets in shuffle-based interconnection networks
- New formulae for the decycling number of graphs
- A note on decycling number, vertex partition and AVD-total coloring in graphs
- Generalized subgraph-restricted matchings in graphs
- The integrity of a cubic graph
- Minimum feedback vertex set and acyclic coloring.
- The cyclomatic number of a graph and its independence polynomial at - 1
- The decycling number of outerplanar graphs
- Hitting subgraphs in \(P_4\)-tidy graphs
- The size of graphs with given feedback vertex number
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Nonseparating independent sets and maximum genus of graphs
- Target set selection on generalized pancake graphs
- Acyclic sum-list-colouring of cylinders
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- Tree-core and tree-coritivity of graphs
- Minimal contagious sets in random regular graphs
- A new formula for the decycling number of regular graphs
- Twins in graphs
- Dominating and large induced trees in regular graphs
- Decycling with a matching
- Maximum induced forests of product graphs
- Decycling cubes and grids
- The decycling number of P_m P^_n
- A feedback vertex set of 2-degenerate graphs
- Decycling squares of trees
- Decycling bipartite tournaments by deleting arcs.
- Decycling powers of paths and of cycles
- scientific article; zbMATH DE number 1472114 (Why is no real title available?)
- scientific article; zbMATH DE number 1751903 (Why is no real title available?)
- New bounds on the decycling number of generalized de Bruijn digraphs
- Acyclic sum-list-colouring of grids and other classes of graphs
- On the decycling number of generalized Kautz digraphs
- The decycling number of generalized Petersen graphs
- Decycling bubble sort graphs
- The k-conversion number of regular graphs
- Cycle intersection graphs and minimum decycling sets of even graphs
- Acyclic polynomials of graphs
- Decycling bipartite graphs
- Decycling \(d\)-ary \(n\)-dimensional cubes
- A lower bound on the \(k\)-conversion number of graphs of maximum degree \(k+1\)
- Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
- The decycling number of graphs \({G_{n{K_4}}}\)
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
- Solution of a conjecture of Vandell on decycling bipartite tournaments by deleting arcs
- Decycling Cartesian Products of Two Cycles
- Decycling of Fibonacci cubes
- scientific article; zbMATH DE number 2230267 (Why is no real title available?)
- scientific article; zbMATH DE number 2230317 (Why is no real title available?)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
- MIP formulations for induced graph optimization problems: a tutorial
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
- Domination number and feedback vertex number of complements of line graphs
- Some bounds on the size of maximum G-free sets in graphs
- Spin Glass approach to the feedback vertex set problem
- The decycling number of a line graph
- Upper-embeddability and the decycling number of connected 4-regular graphs
- On decycling and forest numbers of Cartesian products of trees
- On maximum induced forests of the balanced bipartite graphs
- The decycling number of a graph with large girth embedded in a surface
- The decycling number of a planar graph covered by K₄-subgraphs
- Decycling number of type-k Halin graphs
- An intermediate value theorem for the decycling numbers of Toeplitz graphs
- Feedback numbers of de Bruijn digraphs
This page was built for publication: Decycling graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337506)
