The decycling number of a line graph

DOI10.1016/j.disc.2024.114291MaRDI QIDQ6646413

Han Ren, Mingyuan Ma

Publication date: 2 December 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

line graphdecycling numbercycle rank

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle double covers of graphs with Hamilton paths
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
• On n-hamiltonian line graphs
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• Sur le problème des courbes gauches en topologie.
• On the minimum leaf number of cubic graphs
• A new formula for the decycling number of regular graphs
• Hamilton paths in toroidal graphs
• A Theorem on Planar Graphs
• Note on Hamilton Circuits
• The Decycling Number of Cubic Planar Graphs
• Decycling graphs
• The decycling number and maximum genus of cubic graphs
• Paths, Stars and the Number Three
• Reducibility among Combinatorial Problems
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• On the path partition number of 6‐regular graphs

This page was built for publication: The decycling number of a line graph