"Coloring a graph with Δ-1 colors: Conjectures equivalent to the ..."

Daniel W. Cranston, Landon Rabern (2015)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2014.09.006

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/CranstonR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/CranstonR15
Daniel W. Cranston, Landon Rabern:
Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb. 44: 23-42 (2015)

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.