Pages that link to "Item:Q4347279"
From MaRDI portal
The following pages link to Constructing a bipartite graph of maximum connectivity with prescribed degrees (Q4347279):
Displaying 7 items.
- On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees. (Q960504) (← links)
- On the simultaneous edge-coloring conjecture (Q1567288) (← links)
- On a conjecture of Keedwell and the cycle double cover conjecture (Q1567293) (← links)
- The bipartite-splittance of a bipartite graph (Q1630919) (← links)
- (Q4935900) (← links)
- An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152) (← links)
- (Q5144217) (← links)