Decycling graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H" /><59::AID-JGT4>3.0.CO;2-H 10.1002/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-HzbMath0870.05033OpenAlexW4240625092WikidataQ130480166 ScholiaQ130480166MaRDI QIDQ4337506

Robert C. Vandell, Lowell W. Beineke

Publication date: 19 May 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199705)25:1<59::aid-jgt4>3.0.co;2-h

zbMATH Keywords

gridshypercubesdecycling number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (45)

The size of graphs with given feedback vertex number ⋮ Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Unnamed Item ⋮ New formulae for the decycling number of graphs ⋮ Decycling with a matching ⋮ A feedback vertex set of 2-degenerate graphs ⋮ Nonseparating independent sets and maximum genus of graphs ⋮ The decycling number of $P_{m} \square P_{n}^{\ast}$ ⋮ A new formula for the decycling number of regular graphs ⋮ Decycling bipartite graphs ⋮ 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 ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ An intermediate value theorem for the decycling numbers of Toeplitz graphs ⋮ Maximum induced forests of product graphs ⋮ Target set selection on generalized pancake graphs ⋮ Some bounds on the size of maximum G-free sets in graphs ⋮ Spin Glass approach to the feedback vertex set problem ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ The decycling number of outerplanar graphs ⋮ Twins in graphs ⋮ On the decycling number of generalized Kautz digraphs ⋮ The decycling number of generalized Petersen graphs ⋮ Decycling bubble sort graphs ⋮ Dominating and large induced trees in regular graphs ⋮ Acyclic sum-list-colouring of cylinders ⋮ Acyclic polynomials of graphs ⋮ A note on decycling number, vertex partition and AVD-total coloring in graphs ⋮ A simple proof of an inequality connecting the alternating number of independent sets and the decycling number ⋮ Hitting subgraphs in \(P_4\)-tidy graphs ⋮ Feedback numbers of de Bruijn digraphs ⋮ Generalized subgraph-restricted matchings in graphs ⋮ A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ ⋮ Acyclic sum-list-colouring of grids and other classes of graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ The k-conversion number of regular graphs ⋮ Minimum feedback vertex sets in shuffle-based interconnection networks ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Cycle intersection graphs and minimum decycling sets of even graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The integrity of a cubic graph ⋮ Minimum feedback vertex set and acyclic coloring. ⋮ Minimal contagious sets in random regular graphs

This page was built for publication: Decycling graphs