A new formula for the decycling number of regular graphs
From MaRDI portal
Publication:2404396
DOI10.1016/j.disc.2017.07.011zbMath1370.05105OpenAlexW2743284597MaRDI QIDQ2404396
Tian-xiao Zhao, Chao Yang, Han Ren
Publication date: 18 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.07.011
Related Items (5)
The size of graphs with given feedback vertex number ⋮ Nonseparating independent sets and maximum genus of graphs ⋮ Maximum induced forests of product graphs ⋮ New formulae for the bipartite vertex frustration and decycling number of graphs ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback vertex set in hypercubes
- The decycling number of generalized Petersen graphs
- Maximum induced trees in graphs
- How to determine the maximum genus of a graph
- Reducibility Among Combinatorial Problems
- The Decycling Number of Cubic Planar Graphs
- On feedback vertex sets and nonseparating independent sets in cubic graphs
- Decycling graphs
- The decycling number and maximum genus of cubic graphs
- Decycling numbers of random regular graphs
- Decycling Cartesian Products of Two Cycles
- Combinatorial Geometry and Graph Theory
This page was built for publication: A new formula for the decycling number of regular graphs
