Independent-set-deletable factor-critical power graphs

DOI10.1016/S0252-9602(06)60083-0zbMath1139.05338OpenAlexW2079890636MaRDI QIDQ2426768

Jinjiang Yuan

Publication date: 14 May 2008

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(06)60083-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS] ⋮ Induced matching extendable graph powers ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Unnamed Item ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ 4-regular claw-free IM-extendable graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs

This page was built for publication: Independent-set-deletable factor-critical power graphs