A parameter linked with \(G\)-factors and the binding number

DOI10.1016/0012-365X(90)90239-EzbMath0756.05067MaRDI QIDQ1182867

S. Singh

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

binding numberquasi-regularizable graphsstar-factors

Mathematics Subject Classification ID

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

Related Items (1)

On forwarding indices of networks

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

This page was built for publication: A parameter linked with \(G\)-factors and the binding number