A parameter linked with \(G\)-factors and the binding number
From MaRDI portal
Publication:1182867
DOI10.1016/0012-365X(90)90239-EzbMath0756.05067MaRDI QIDQ1182867
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C99: Graph theory
Cites Work
- Unnamed Item
- On generalized matching problems
- Computing the binding number of a graph
- On forwarding indices of networks
- The forwarding index of communication networks
- Packings by Complete Bipartite Graphs
- Which rational numbers are binding numbers?
- Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
- The binding number of a graph and its Anderson number