Closure, stability and iterated line graphs with a 2-factor
From MaRDI portal
Publication:1044973
DOI10.1016/j.disc.2009.03.003zbMath1183.05072OpenAlexW1995720123MaRDI QIDQ1044973
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Even factors with a bounded number of components in iterated line graphs ⋮ Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ Closure operation for even factors on claw-free graphs ⋮ Minimum number of components of 2-factors in iterated line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The hamiltonian index of a 2-connected graph
- On a closure concept in claw-free graphs
- Hamiltonian iterated line graphs
- The Hamiltonian index of a graph and its branch-bonds
- Closure concepts: A survey
- Closure and factor-critical graphs
- On the 2-factor index of a graph
- On stability of the hamiltonian index under contractions and closures
- Closure and stable Hamiltonian properties in claw-free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Hamilton cycles and closed trails in iterated line graphs
This page was built for publication: Closure, stability and iterated line graphs with a 2-factor