Connected even factors in the square of essentially 2-edge-connected graph

zbMATH Open1369.05125arXiv1412.8709MaRDI QIDQ2401428FDOQ2401428

Authors: Jan Ekstein, Baoyindureng Wu, Liming Xiong 

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1412.8709

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

zbMATH Keywords

square of graphsconnected even factorsessentially 2-edge connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Even factors of large size
• Star subdivisions and connected even factors 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
• Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• A short proof of the versatile version of Fleischner's theorem
• Hamiltonian cycles in the square of a graph
• Forbidden subgraphs and hamiitonian properties in the square of a connected graph
• The square of a block is Hamiltonian connected
• The square of a block is strongly path connected
• On graphs with Hamiltonian squares
• Connected even factors in claw-free graphs
• Title not available (Why is that?)

Cited In (4)

• Star subdivisions and connected even factors in the square of a graph
• Extremal spectral radius and essential edge-connectivity
• Title not available (Why is that?)
• Two-edge-connected \([2,k]\)-factors in graphs

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)