Even factors with a bounded number of components in iterated line graphs

DOI10.1007/S11425-015-0506-3zbMath1365.05153OpenAlexW2376580925MaRDI QIDQ2360854

Limning Xiong, Sheng-mei Lv

Publication date: 29 June 2017

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-015-0506-3

zbMATH Keywords

claw-free graphbranchclosureeven factoriterated line graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• On extremal \(k\)-supereulerian graphs
• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Hamiltonian index is NP-complete
• The existence of even factors in iterated line graphs
• Closure, stability and iterated line graphs with a 2-factor
• On a closure concept in claw-free graphs
• Hamiltonian iterated line graphs
• The Hamiltonian index of a graph and its branch-bonds
• Closure operation for even factors on claw-free graphs
• A note on graphs spanned by Eulerian graphs
• The structure and existence of 2-factors in iterated line graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs
• A Note on Sub-Eulerian Graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Video Deblurring Algorithm Using Accurate Blur Kernel Estimation and Residual Deconvolution Based on a Blurred-Unblurred Frame Pair
• Hamilton cycles and closed trails in iterated line graphs

This page was built for publication: Even factors with a bounded number of components in iterated line graphs