"A Better Lower Bound on Average Degree of Online k-List-Critical Graphs."

Landon Rabern (2018)

> Home

Details and statistics

DOI: 10.37236/6405

access: open

type: Journal Article

metadata version: 2025-12-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/combinatorics/Rabern18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/Rabern18
Landon Rabern:
A Better Lower Bound on Average Degree of Online k-List-Critical Graphs. Electron. J. Comb. 25(1): 1 (2018)

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.