scientific article; zbMATH DE number 5846957

MaRDI QIDQ3071963zbMATH OpenFDO

Authors Renying Chang

Publication date 5 February 2011

zbMATH Keywords

graphcritical graphisolated toughness

Mathematics Subject Classification ID

Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Recommendations

• A sufficient condition for a graph to be an (a, b, k)-critical graph
• A sufficient condition for graphs to be \( (g,f,k)\)-critical graphs
• A new sufficient condition for graphs to be \((a,b,k)\)-critical graphs.
• Some new sufficient conditions for graphs to be \((a,b,k)\)-critical graphs.
• scientific article; zbMATH DE number 2121690
• \((a,b,k)\)-critical graphs
• scientific article; zbMATH DE number 5733928
• scientific article; zbMATH DE number 5777928
• A result on \((a,b,k)\)-critical graphs.
• A binding number condition for graphs to be (a, b, k)-critical graphs

Cited in

(8)

• scientific article; zbMATH DE number 2073945 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 5733928 (Why is no real title available?)
• scientific article; zbMATH DE number 5777928 (Why is no real title available?)
• \((a,b,k)\)-critical graphs
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors

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 Q3071963)