Font Size:
a
A
A
Keyword [Graph packing]
Result: 1 - 9 | Page: 1 of 1
1.
Maximal Packing And Minimal Covering Of The Complete Bipartite Graph K
m, N
With C
8
2.
The Metamorphosis Of Two Bipartite Graph Designs Into Subgraph Designs
3.
Two 6.9-edge Map Filling And Cover Design
4.
Complete T-(k <sub> 1, K </ Sub>) - Triple Systems,
5.
Some Octagonal Diagram Fill Coverage
6.
On Some Properties Of Archimedean Tiling Graphs
7.
Graph Decompositions And Related Problems
8.
Graph Designs For Graphs Of Nine Vertices With Nine Edges And A 5-Circuit
9.
Packing And Covering Triangles In （K
4
,W
4
）-Free Graphs
<<First
<Prev Next>
Last>>
Jump to
