New formulae for the decycling number of graphs

DOI10.7151/dmgt.2064zbMath1401.05074OpenAlexW2794588252MaRDI QIDQ1630929

Han Ren, Chao Yang

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2064

zbMATH Keywords

independence numberdecycling numbercycle rankmargin number

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Cites Work

• 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
• 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
• Reducibility among Combinatorial Problems
• Decycling Cartesian Products of Two Cycles
• Combinatorial Geometry and Graph Theory