scientific article; zbMATH DE number 1744105

MaRDI QIDQ4529530zbMATH OpenFDO

Authors Sheng Bau, L. W. Beineke

Publication date 10 June 2002

Full work available at URL https://arxiv.org/abs/math/0703544

zbMATH Keywords

boundsconnectivitycubic graphsdecycling numberdecycling setrandom regular graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The decycling number of regular graphs
• Decycling cubes and grids
• Decycling of Fibonacci cubes
• Combinatorial Geometry and Graph Theory
• scientific article; zbMATH DE number 2186982

Cited in

(45)

• New formulae for the decycling number of graphs
• Degenerate matchings and edge colorings
• The decycling number of outerplanar graphs
• New formulae for the bipartite vertex frustration and decycling number of graphs
• Target set selection on generalized pancake graphs
• Feedback arc number and feedback vertex number of Cartesian product of directed cycles
• Tree-core and tree-coritivity of graphs
• Feedback vertex sets in mesh-based networks
• A new formula for the decycling number of regular graphs
• Dominating and large induced trees in regular graphs
• Feedback vertex sets in cubic multigraphs
• Decycling with a matching
• The number of cycles with a given descent set
• Decycling cubes and grids
• The decycling number of P_m P^_n
• Decycling squares of trees
• scientific article; zbMATH DE number 2186982 (Why is no real title available?)
• Feedback vertex number of Sierpiński-type graphs
• Decycling powers of paths and of cycles
• The decycling number of regular graphs
• Maximum induced forests in graphs of bounded treewidth
• On the bounds of feedback numbers of \((n,k)\)-star graphs
• scientific article; zbMATH DE number 1472114 (Why is no real title available?)
• The decycling number and maximum genus of cubic graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• On the decycling number of generalized Kautz digraphs
• The decycling number of generalized Petersen graphs
• Decycling numbers of random regular graphs
• Decycling bubble sort graphs
• Cycle intersection graphs and minimum decycling sets of even graphs
• Acyclic polynomials of graphs
• Decycling bipartite graphs
• Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
• Decycling sets in certain Cartesian product graphs with one factor complete
• Decycling connected regular graphs
• Combinatorial Geometry and Graph Theory
• Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
• Domination number and feedback vertex number of complements of line graphs
• Decycling cubic graphs
• On blockers and transversals of maximum independent sets in co-comparability graphs
• Upper-embeddability and the decycling number of connected 4-regular graphs
• On decycling and forest numbers of Cartesian products of trees
• Counting loopy graphs with given degrees
• An intermediate value theorem for the decycling numbers of Toeplitz graphs
• Feedback numbers of de Bruijn digraphs

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)