Binding numbers and (a,b,k)-critical graphs.
From MaRDI portal
Publication:4649993
zbMATH Open1265.05494MaRDI QIDQ4649993FDOQ4649993
Authors: Xiangyang Lv
Publication date: 15 November 2012
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (6)
- A result on \((a,b,k)\)-critical graphs.
- BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
- Title not available (Why is that?)
- A binding number condition for graphs to be \((a, b, k)\)-critical graphs
- Notes on the binding numbers for (a, b, k)-critical graphs
- Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
This page was built for publication: Binding numbers and \((a,b,k)\)-critical graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649993)