"The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree."

Jakub Przybylo (2022)

> Home

Details and statistics

DOI: 10.1007/S00493-021-4822-0

access: closed

type: Journal Article

metadata version: 2023-10-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Przybylo22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Przybylo22
Jakub Przybylo:
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree. Comb. 42(Supplement 2): 1487-1512 (2022)

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.