"Complexity of Computing the Anti-Ramsey Numbers for Paths."

Saeed Akhoondian Amiri et al. (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2020.6

access: open

type: Conference or Workshop Paper

metadata version: 2020-08-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/Amiri0RSS020
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/Amiri0RSS020
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi:
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS 2020: 6:1-6:14

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.