"(1, 2)-rainbow connection number at most 3 in connected dense graphs."

Trung Duy Doan, Le Thi Duyen (2023)

> Home

Details and statistics

DOI: 10.5614/EJGTA.2023.11.2.6

access: open

type: Journal Article

metadata version: 2023-12-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejgta/DoanD23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejgta/DoanD23
Trung Duy Doan, Le Thi Duyen:
(1, 2)-rainbow connection number at most 3 in connected dense graphs. Electron. J. Graph Theory Appl. 11(2): 411-417 (2023)

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.