Defines d-capacity for graphs, computes exact values for paths and cycles, gives bounds for bipartite graphs, and characterizes topfull graphs via factorizations and connectivity.
Prentice Hall, Upper Saddle River (N.J.), second edition
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Span capacities of graphs
Defines d-capacity for graphs, computes exact values for paths and cycles, gives bounds for bipartite graphs, and characterizes topfull graphs via factorizations and connectivity.