The existence of \(k\)-factors in squares of graphs

DOI10.1016/j.disc.2010.07.024zbMath1221.05266OpenAlexW2052217818MaRDI QIDQ712263

Olga Fourtounelli, P. Katerinis

Publication date: 28 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.024

zbMATH Keywords

square of a graph\(k\)-factorminimum degree of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (12)

A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs] ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor] ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ Induced claws and existence of even factors of graphs ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles through \(k+2\) vertices in \(k\)-connected graphs
• Toughness of graphs and the existence of factors
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Some Hamiltonian results in powers of graphs
• The Factors of Graphs

This page was built for publication: The existence of \(k\)-factors in squares of graphs