"On a k-clique-join of a class of partitionable graphs."

Mihai Talmaciu (2005)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-09-02

- view
  - electronic edition @ math.md (open access)
- export record
  dblp key:
  - journals/csjm/Talmaciu05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csjm/Talmaciu05
Mihai Talmaciu:
On a k-clique-join of a class of partitionable graphs. Comput. Sci. J. Moldova 13(1): 37-46 (2005)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.