On (g,f,n)-critical graphs.

MaRDI QIDQ5492603zbMATH OpenFDO

Authors Jianxiang Li, Haruhide Matsuda

Publication date 16 October 2006

zbMATH Keywords

\((g,f)\)-factorfactor-critical graph

Mathematics Subject Classification ID

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

Recommendations

• A result on (g,f,n)-critical graphs
• Minimum degree conditions for graphs to be (g,f,n)-critical graphs
• scientific article; zbMATH DE number 2121690
• Neighbor set for the existence of (g,f,n)-critical graphs
• scientific article; zbMATH DE number 5912077

Cited in

(8)

• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• (-1)-critical graphs.
• Minimum degree conditions for graphs to be (g,f,n)-critical graphs
• A sufficient condition for graphs to be \( (g,f,k)\)-critical graphs
• A result on (g,f,n)-critical graphs
• scientific article; zbMATH DE number 2121690 (Why is no real title available?)
• Neighbor set for the existence of (g,f,n)-critical graphs
• On toughness and fractional (g,f,n)-critical graphs

This page was built for publication: On \((g,f,n)\)-critical graphs.

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