Minimum degree, independence number and pseudo [2, b]-factors in graphs

DOI10.1016/J.DAM.2013.09.005MaRDI QIDQ741726zbMATH OpenOpenAlexFDO

Authors Siham Bekkai

Publication date 12 September 2014

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

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

zbMATH Keywords

independence numberminimum degreepseudo \([2,b\)-factor]

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or vertices in a pseudo [2,b]-factor of a graph G. This bound is sharp.

Recommendations

• On pseudo 2-factors
• Independence number and minimum degree for \([a,b]\)-factors
• Independence number and \([a,b]\)-factors of graphs.
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
• Minimum degree, independence number and regular factors

Cites work

• Connected factors in graphs -- a survey
• Graph factors and factorization: 1985--2003: a survey
• Graph partition problems into cycles and paths
• Graph theory
• scientific article; zbMATH DE number 3215865 (Why is no real title available?)
• On pseudo 2-factors
• Stability number and [a,b]‐factors in graphs

Cited in

(8)

• On pseudo 2-factors
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
• Minimum degree, independence number and regular factors
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• scientific article; zbMATH DE number 5953644 (Why is no real title available?)
• Path-factor critical covered graphs and path-factor uniform graphs
• Minimum degree of bipartite graphs and the existence of k-factors

This page was built for publication: Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs

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