The k-conversion number of regular graphs
DOI10.1016/j.akcej.2019.12.016zbMath1468.05295arXiv1812.03250OpenAlexW3048214410MaRDI QIDQ4956206
Jane Wodlinger, Christina M. Mynhardt
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03250
cubic graphdecycling numberdecycling set\(k\)-conversion numberirreversible \(k\)-threshold conversion process
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound on the order of the largest induced forest in planar graphs with high girth
- On dynamic monopolies of graphs with general thresholds
- On the maximum induced forests of a connected cubic graph without triangles
- Induced forests in cubic graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- On lower bounds of number of perfect matchings in fullerene graphs
- \((k,g)\)-cages are 3-connected
- Decycling hypercubes
- Large induced forests in planar graphs with girth 4
- A new bound on the feedback vertex sets in cubic graphs
- Lower Bounds For Induced Forests in Cubic Graphs
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Decycling graphs
- Combinatorial Geometry and Graph Theory
- k-Degenerate Graphs
- Polyhedral decompositions of cubic graphs
This page was built for publication: The k-conversion number of regular graphs
