The decycling number of a line graph
type: Item
instance of: scholarly article
title: The decycling number of a line graph
author: Mingyuan Ma
author: Han Ren
published in: Discrete Mathematics
publication date: 2024-12-02T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7952102
zbMATH Keywords: line graph
zbMATH Keywords: decycling number
zbMATH Keywords: cycle rank
MaRDI profile type: Publication
cites work: Decycling graphs
cites work: Q5422499
cites work: Q4137202
cites work: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
cites work: On the path partition number of 6‐regular graphs
cites work: Q3145802
cites work: Cycle double covers of graphs with Hamilton paths
cites work: On the minimum leaf number of cubic graphs
cites work: Q3855224
cites work: Q3971782
cites work: Reducibility among Combinatorial Problems
cites work: Sur le problème des courbes gauches en topologie.
cites work: On n-hamiltonian line graphs
cites work: The decycling number and maximum genus of cubic graphs
cites work: Q3614027
cites work: Path partitions of almost regular graphs
cites work: Note on Hamilton Circuits
cites work: Q3540287
cites work: The Decycling Number of Cubic Planar Graphs
cites work: Paths, Stars and the Number Three
cites work: A new formula for the decycling number of regular graphs
cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
cites work: 4-connected projective planar graphs are Hamiltonian
cites work: Hamilton paths in toroidal graphs
cites work: Five-connected toroidal graphs are Hamiltonian
cites work: A Theorem on Planar Graphs
DOI: 10.1016/J.DISC.2024.114291
description: scientific article; zbMATH DE number 7952102