On 2-factors with a specified number of components in line graphs

MaRDI QIDQ6621179FDO

Authors Shuya Chiba, Yoshimi Egawa, Jun Fujisawa, Akira Saito, Ingo Schiermeyer, Masao Tsugaki, Tomoki Yamashita

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 5038486
• Hamilton cycles in 5-connected line graphs
• scientific article; zbMATH DE number 7021376
• On 2-factors with \(k\) components
• scientific article; zbMATH DE number 5307575

Cites work

• scientific article; zbMATH DE number 4108816 (Why is no real title available?)
• scientific article; zbMATH DE number 1289749 (Why is no real title available?)
• Advances on the Hamiltonian problem -- a survey
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Degree conditions for 2-factors
• Hamilton cycles in 5-connected line graphs
• Hamiltonian results inK1,3-free graphs
• How many conjectures can you stand? A survey
• Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
• Note on Hamilton Circuits
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs
• On hamiltonian line graphs and connectivity
• Recent advances on the Hamiltonian problem: survey III
• Reflections on graph theory

This page was built for publication: On 2-factors with a specified number of components in line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621179)