scientific article; zbMATH DE number 1744105
From MaRDI portal
Publication:4529530
zbMath0994.05079arXivmath/0703544MaRDI QIDQ4529530
Publication date: 10 June 2002
Full work available at URL: https://arxiv.org/abs/math/0703544
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)
Related Items (25)
New formulae for the decycling number of graphs ⋮ Decycling with a matching ⋮ Feedback vertex sets in mesh-based networks ⋮ A new formula for the decycling number of regular graphs ⋮ Decycling bipartite graphs ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ 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 ⋮ Target set selection on generalized pancake graphs ⋮ On the bounds of feedback numbers of \((n,k)\)-star graphs ⋮ Degenerate matchings and edge colorings ⋮ 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 polynomials of graphs ⋮ New formulae for the bipartite vertex frustration and decycling number of graphs ⋮ Feedback numbers of de Bruijn digraphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Feedback vertex sets in cubic multigraphs ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Cycle intersection graphs and minimum decycling sets of even graphs ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ Tree-core and tree-coritivity of graphs
This page was built for publication:
