"Is there any polynomial upper bound for the universal labeling of graphs?"

Arash Ahadi, Ali Dehghan, Morteza Saghafian (2017)

> Home

Details and statistics

DOI: 10.1007/S10878-016-0107-8

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/AhadiDS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/AhadiDS17
Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34(3): 760-770 (2017)

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.