scientific article; zbMATH DE number 1744105
From MaRDI portal
Publication:4529530
zbMATH Open0994.05079arXivmath/0703544MaRDI QIDQ4529530FDOQ4529530
Authors: Sheng Bau, L. W. Beineke 
Publication date: 10 June 2002
Full work available at URL: https://arxiv.org/abs/math/0703544
Title of this publication is not available (Why is that?)
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cited In (43)
- Decycling connected regular graphs
- Combinatorial Geometry and Graph Theory
- Maximum induced forests in graphs of bounded treewidth
- Cycle intersection graphs and minimum decycling sets of even graphs
- New formulae for the bipartite vertex frustration and decycling number of graphs
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Decycling numbers of random regular graphs
- The decycling number of \(P_m\square P^\ast_n\)
- New formulae for the decycling number of graphs
- A new formula for the decycling number of regular graphs
- Degenerate matchings and edge colorings
- On the bounds of feedback numbers of \((n,k)\)-star graphs
- Title not available (Why is that?)
- Feedback vertex sets in cubic multigraphs
- Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
- Feedback vertex sets in mesh-based networks
- Decycling squares of trees
- Decycling cubic graphs
- Tree-core and tree-coritivity of graphs
- An intermediate value theorem for the decycling numbers of Toeplitz graphs
- New bounds on the decycling number of generalized de Bruijn digraphs
- Decycling sets in certain Cartesian product graphs with one factor complete
- On the decycling number of generalized Kautz digraphs
- The decycling number of generalized Petersen graphs
- Counting loopy graphs with given degrees
- Decycling bipartite graphs
- Acyclic polynomials of graphs
- Title not available (Why is that?)
- Dominating and large induced trees in regular graphs
- Feedback numbers of de Bruijn digraphs
- Decycling with a matching
- Domination number and feedback vertex number of complements of line graphs
- Decycling bubble sort graphs
- The number of cycles with a given descent set
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- The decycling number and maximum genus of cubic graphs
- Decycling cubes and grids
- The decycling number of regular graphs
- Target set selection on generalized pancake graphs
- Feedback vertex number of Sierpiński-type graphs
- Decycling powers of paths and of cycles
- The decycling number of outerplanar graphs
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529530)
