Cycle intersection graphs and minimum decycling sets of even graphs

DOI10.1142/S1793830920500275zbMath1456.05031arXiv1810.04252OpenAlexW3003939283MaRDI QIDQ4965894

Michael Cary

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.04252

zbMATH Keywords

spanning treeeven graphdecycling numberdecyclingcycle rank

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Vertices with the second neighborhood property in Eulerian digraphs

Cites Work

• The decycling number of generalized Petersen graphs
• Decycling bubble sort graphs
• A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
• On inverse problems for the cycle graph operator
• Decycling hypercubes
• Large induced forests in triangle-free planar graphs
• The Decycling Number of Cubic Planar Graphs
• A reduction method to find spanning Eulerian subgraphs
• Decycling graphs
• Decycling numbers of random regular graphs
• Reducibility among Combinatorial Problems
• Vertices with the second neighborhood property in Eulerian digraphs
• Combinatorial Geometry and Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle intersection graphs and minimum decycling sets of even graphs