Connected even factors in the square of essentially 2-edge-connected graph
From MaRDI portal
Publication:2401428
zbMath1369.05125arXiv1412.8709MaRDI QIDQ2401428
Baoyindureng Wu, Jan Ekstein, Limning Xiong
Publication date: 8 September 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.8709
Cites Work
- Unnamed Item
- A short proof of the versatile version of Fleischner's theorem
- Star subdivisions and connected even factors in the square of a graph
- Hamiltonian cycles in the square of a graph
- On graphs whose square have strong Hamiltonian properties
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- On graphs with Hamiltonian squares
- The square of a block is Hamiltonian connected
- Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
- The square of a block is strongly path connected
- Connected even factors in claw-free graphs
- Even Factors of Large Size
- Forbidden subgraphs and hamiitonian properties in the square of a connected graph
- The square of a connected S(K1,3)-free graph is vertex pancyclic
This page was built for publication: Connected even factors in the square of essentially 2-edge-connected graph