Binding numbers of fractional \(k\)-deleted graphs

DOI10.3792/PJAA.86.85zbMath1219.05141OpenAlexW2062213743MaRDI QIDQ989434

Keiko Kotani

Publication date: 20 August 2010

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.86.85

zbMATH Keywords

binding numberfractional factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

An existence theorem on fractional deleted graphs ⋮ A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties

Cites Work

• Unnamed Item
• A result on fractional $k$-deleted graphs
• The binding number of a graph and its Anderson number

This page was built for publication: Binding numbers of fractional \(k\)-deleted graphs