The existence of k-factors in squares of graphs

DOI10.1016/J.DISC.2010.07.024zbMATH Open1221.05266OpenAlexW2052217818MaRDI QIDQ712263FDOQ712263

Authors: 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)

Cites Work

• Graph theory
• Tough graphs and Hamiltonian circuits.
• The Factors of Graphs
• Toughness and the existence ofk-factors
• Toughness of graphs and the existence of factors
• Title not available (Why is that?)
• Some Hamiltonian results in powers of graphs
• Cycles through \(k+2\) vertices in \(k\)-connected graphs

Cited In (12)

• Binding number and minimum degree for fractional \((k,m)\)-deleted graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical 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
• A binding number condition for graphs to be \((a, b, k)\)-critical graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
• Stability Number and k-Hamiltonian [a, b]-factors
• Stability number and minimum degree for (\(a, b, k\))-critical graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712263)