Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.
From MaRDI portal
Publication:4683286
zbMATH Open1488.05185MaRDI QIDQ4683286FDOQ4683286
Authors: Jiangxu Kong, Suohai Fan, Hong-Jian Lai, Murong Xu
Publication date: 20 September 2018
Recommendations
- Linear list r-hued coloring of sparse graphs
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
- Linear list colorings of graphs with maximum average degrees bounded.
- On \(r\)-hued coloring of graphs with maximum average degree less than 3.
- Linear list coloring of some sparse graphs
Cited In (6)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
- List \(r\)-dynamic coloring of graphs with small maximum average degree
- Linear list coloring of some sparse graphs
- Linear list r-hued coloring of sparse graphs
- Linear list colorings of graphs with maximum average degrees bounded.
- On \(r\)-hued coloring of graphs with maximum average degree less than 3.
This page was built for publication: Linear list \(r\)-hued colorings of graphs with bounded maximum subgraph average degrees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683286)