Connected even factors in the square of essentially 2-edge-connected graph
From MaRDI portal
(Redirected from Publication:2401428)
Abstract: In this paper we prove that the square of an essentially 2-edge connected graph with an additional property has a connected even factor with maximum degree at most 4. Moreover we show that, in general, the square of essentially 2-edge connected graph does not contain a connected even factor with bounded maximum degree.
Recommendations
- Star subdivisions and connected even factors in the square of a graph
- Edge-connectivity and edges of even factors of graphs
- Even factor of a graph with a bounded number of components
- Two-edge-connected \([2,k]\)-factors in graphs
- Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph
Cites work
- scientific article; zbMATH DE number 6475977 (Why is no real title available?)
- A short proof of the versatile version of Fleischner's theorem
- Connected even factors in claw-free graphs
- Even factors of large size
- Forbidden subgraphs and hamiitonian properties in the square of a connected graph
- Hamiltonian cycles in the square of a graph
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
- On graphs whose square have strong Hamiltonian properties
- On graphs with Hamiltonian squares
- Star subdivisions and connected even factors in the square of a graph
- The square of a block is Hamiltonian connected
- The square of a block is strongly path connected
- The square of a connected S(K1,3)-free graph is vertex pancyclic
Cited in
(4)
This page was built for publication: Connected even factors in the square of essentially 2-edge-connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401428)
