Some results on binding number and fractional perfect matching
From MaRDI portal
Publication:2471341
DOI10.1007/BF02832358zbMath1133.05082MaRDI QIDQ2471341
Publication date: 22 February 2008
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02832358
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs, Degree and stability number condition for the existence of connected factors in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural properties for certain classes of infinite planar graphs
- On oriented 2-factorable graphs
- Toughness and matching extension in graphs
- Binding number and toughness for matching extension
- The classification of complete graphs \(K_n\) on \(f\)-coloring
- The binding number of a graph and its Anderson number