On 2-factors with a specified number of components in line graphs
From MaRDI portal
Publication:6621179
Jun Fujisawa, Ingo Schiermeyer, Yoshimi Egawa, Shuya Chiba, Masao Tsugaki, Akira Saito, Tomoki Yamashita
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
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)
Cites Work
- On a closure concept in claw-free graphs
- Note on Hamilton Circuits
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Hamiltonian results inK1,3-free graphs
- Hamilton cycles in 5-connected line graphs
- Reflections on graph theory
- On hamiltonian line graphs and connectivity
- Recent advances on the Hamiltonian problem: survey III
- Advances on the Hamiltonian problem -- a survey
- Title not available (Why is that?)
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
- Degree conditions for 2-factors
- How many conjectures can you stand? A survey
- Title not available (Why is that?)
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)
