Star subdivisions and connected even factors in the square of a graph

DOI10.1016/J.DISC.2011.09.004zbMath1246.05095arXiv1206.4825OpenAlexW2005144493MaRDI QIDQ442370

Tomáš Kaiser, Přemysl Holub, Jan Ekstein, Sheng Gui Zhang, Limning Xiong

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

square of a graph\(S(K_{12s+1})\)connected even factor

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ Connected even factors in the square of essentially 2-edge-connected graph ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ Induced claws and existence of even factors of graphs ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• Unnamed Item
• Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• The square of every two-connected graph is Hamiltonian
• 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: Star subdivisions and connected even factors in the square of a graph