Characterization of triangular and lattice graphs
- 19 Downloads
KeywordsConnected Graph Regular Graph Adjacent Vertex Generalize Quadrangle Lattice Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 2.A. A. Ageev, “dominating sets and hamiltonicity inK 1,3-free graphs,” Sibirsk. Mat. Zh.,35, No. 3, 475–479 (1994).Google Scholar
- 5.V. V. Kabanov and A. A. Makhnëv, “Co-edge-regular graphs without 3-claws,” Mat. Zametki,60, No. 4, 495–503 (1996).Google Scholar
- 6.V. V. Kabanov and A. A. Makhnëv, “On separable graphs with some regularity conditions,” Mat. Sb.,187, No. 10, 73–86 (1996).Google Scholar
© Plenum Publishing Corporation 1998