A binding number condition for graphs to be (a, b, k)-critical graphs

DOI10.1016/J.AJMSC.2012.01.001zbMATH Open1251.05146OpenAlexW1982202523MaRDI QIDQ442161FDOQ442161

Authors: Jiashang Jiang, Lan Xu, Sizhong Zhou 

Publication date: 10 August 2012

Published in: Arab Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ajmsc.2012.01.001

Recommendations

• Notes on the binding numbers for (a, b, k)-critical graphs
• BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
• scientific article; zbMATH DE number 5733928
• Binding numbers and \((a,b,k)\)-critical graphs.
• scientific article; zbMATH DE number 6119662

zbMATH Keywords

graph\((a,b,k)\)-critical graph\([a,b\)-factor]binding number

Mathematics Subject Classification ID

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

Cites Work

• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Binding numbers of fractional \(k\)-deleted graphs
• The binding number of a graph and its Anderson number
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• A new degree condition for graphs to have \([a,b]\)-factor
• \((a,b,k)\)-critical graphs.
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Notes on the binding numbers for (a, b, k)-critical graphs
• The existence of \(k\)-factors in squares of graphs

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Stability number and minimum degree for (\(a, b, k\))-critical graphs

This page was built for publication: A binding number condition for graphs to be \((a, b, k)\)-critical graphs

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