scientific article; zbMATH DE number 7106995
From MaRDI portal
Publication:5197598
zbMath1419.05072MaRDI QIDQ5197598
Michael D. Francis, Jane Wodlinger, Christina M. Mynhardt
Publication date: 19 September 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p288.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Irreversible \(k\)-threshold conversion number of circulant graphs ⋮ Irreversible k-threshold conversion number of some graphs
Cites Work
- A lower bound on the order of the largest induced forest in planar graphs with high girth
- On the maximum induced forests of a connected cubic graph without triangles
- Induced forests in cubic graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Decycling hypercubes
- Large induced forests in planar graphs with girth 4
- Vertex arboricity and maximum degree
- A new bound on the feedback vertex sets in cubic graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Lower Bounds For Induced Forests in Cubic Graphs
- Critical Point-Arboritic Graphs
- Decycling graphs
- Combinatorial Geometry and Graph Theory
- Decomposition of Finite Graphs Into Forests
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
