Linear list r-hued coloring of K₄-minor free graphs.

MaRDI QIDQ5206415zbMATH OpenFDO

Authors Jiangxu Kong, Hong-Jian Lai, Murong Xu

Publication date 18 December 2019

zbMATH Keywords

\(K_4\)-minor free graphlinear list \(r\)-hued coloringplanar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Recommendations

• On r-hued coloring of K₄-minor free graphs
• On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
• On \(r\)-hued colorings of graphs without short induced paths
• Decomposition and r-hued coloring of K₄(7)-minor free graphs
• On list r-hued coloring of planar graphs

Cited in

(7)

• List-coloring graphs without \(K_{4,k}\)-minors
• A coloring algorithm for \(4 K_1\)-free line graphs
• On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
• Decomposition and r-hued coloring of K₄(7)-minor free graphs
• List colorings of K₅-minor-free graphs with special list assignments
• On r-hued coloring of K₄-minor free graphs
• Linear list r-hued coloring of sparse graphs

This page was built for publication: Linear list \(r\)-hued coloring of \(K_4\)-minor free graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206415)