Home

Open Problem Garden

  • Help
  • About
  • Contact
  login/create account

text loans, text payday loans


Graph Theory » Coloring » Vertex coloring

Bounding the on-line choice number in terms of the choice number ★★

Author(s): Zhu

Question   Are there graphs for which $ \text{ch}^{\text{OL}}-\text{ch} $ is arbitrarily large?

Keywords: choosability; list coloring; on-line choosability

Posted by Jon Noel
updated April 11th, 2013
add new comment

Wong, Tsai-Lien


on-line choosability


Huang, Po-Yi


Graph Theory » Coloring » Vertex coloring

Choice number of complete multipartite graphs with parts of size 4 ★

Author(s):

Question   What is the choice number of $ K_{4*k} $ for general $ k $?

Keywords: choosability; complete multipartite graph; list coloring

Posted by Jon Noel
updated April 11th, 2013
add new comment

DIVISOR,REMAINDER


PARASURAMAN DIVYA


KRISHNARAM VENKATESH


sunglass warehouse turquoise and men's


« first‹ previous…575859606162636465…next ›last »

Navigate

  • Subject
    • Algebra (298)
    • Analysis (5)
    • Combinatorics (35)
    • Geometry (29)
    • Graph Theory (228)
    • Group Theory (5)
    • Logic (10)
    • Number Theory (49)
    • PDEs (0)
    • Probability (1)
    • Theoretical Comp. Sci. (13)
    • Topology (40)
    • Unsorted (1)
  • Author index
  • Keyword index
  • more

Recent Activity

  • Is Dragon Ball Legends Safe? Account Security Guide — Avoid Bans, Scams & Hacks (2026)
  • Dragon Ball Legends PvP Team Building Guide — Tags, Synergy & Win Conditions (2026)
  • Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
  • Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
  • Nowhere-zero flows
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer