default search action

combined dblp search
author search
venue search
publication search

ask others

"How many randomly colored edges make a randomly colored dense graph ..."

Michael Anastos, Alan M. Frieze (2019)

> Home

Details and statistics

DOI: 10.1002/JGT.22461

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/AnastosF19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/AnastosF19
Michael Anastos, Alan M. Frieze:
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? J. Graph Theory 92(4): 405-414 (2019)

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.