scientific article; zbMATH DE number 5846957

zbMATH Open1224.05102MaRDI QIDQ3071963FDOQ3071963

Authors: Renying Chang 

Publication date: 5 February 2011

Title of this publication is not available (Why is that?)

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
• scientific article
• A result on \((a,b,k)\)-critical graphs.
• A binding number condition for graphs to be \((a, b, k)\)-critical graphs

zbMATH Keywords

graphcritical graphisolated toughness

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
• Title not available (Why is that?)
• Title not available (Why is that?)
• \((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)