scientific article; zbMATH DE number 2121690

MaRDI QIDQ4830487zbMATH OpenFDO

Authors Jianxiang Li

Publication date 10 December 2004

zbMATH Keywords

independent set\((g,f)\)-factor\((g,f,n)\)-critical graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On \((g,f,n)\)-critical graphs.
• Neighbor set for the existence of (g,f,n)-critical graphs
• Minimum degree conditions for graphs to be \((g,f,n)\)-critical graphs
• A result on \((g,f,n)\)-critical graphs
• NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS

Cited in

(11)

• scientific article; zbMATH DE number 4075124 (Why is no real title available?)
• A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• scientific article; zbMATH DE number 1854040 (Why is no real title available?)
• A binding number condition for graphs to be (a, b, k)-critical graphs
• scientific article; zbMATH DE number 5846957 (Why is no real title available?)
• On toughness and fractional \((g,f,n)\)-critical graphs
• A sufficient condition for graphs to be \( (g,f,k)\)-critical graphs
• On \((g,f,n)\)-critical graphs.
• Minimum degree conditions for graphs to be \((g,f,n)\)-critical graphs
• A sufficient condition for a graph to be an (a, b, k)-critical graph

This page was built for publication:

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