Dynamic choosability of triangle‐free graphs and sparse random graphs

DOI10.1002/jgt.22161zbMath1386.05060arXiv1503.04492OpenAlexW3101413812MaRDI QIDQ4638632

Seongmin Ok, Jae-Hoon Kim

Publication date: 27 April 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04492

zbMATH Keywords

dynamic coloringstrong coloringdynamic choosabilitydynamic list coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (2)

Optimal secret share distribution in degree splitting communication networks ⋮ List 3-dynamic coloring of graphs with small maximum average degree

This page was built for publication: Dynamic choosability of triangle‐free graphs and sparse random graphs