Dynamic proper colorings of a graph

DOI10.1007/S10958-011-0612-3zbMATH Open1402.05070OpenAlexW2063220326MaRDI QIDQ2256703FDOQ2256703

Authors: Yanyan Li 

Publication date: 20 February 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-011-0612-3

Recommendations

• An analog of Brooks' theorem for dynamic colorings
• Dynamic coloring of graphs having no \(K_5\) minor
• scientific article; zbMATH DE number 2197944
• On \(r\)-dynamic coloring of subdivision-vertex join of two graphs
• On the dynamic coloring of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Colouring a graph frugally
• A strengthening of Brooks' theorem
• Title not available (Why is that?)
• Nondegenerate colourings in the Brooks theorem

Cited In (8)

• Title not available (Why is that?)
• On the dynamic coloring of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamic coloring on restricted graph classes
• Graph \(r\)-hued colorings -- a survey
• Brooks-type theorem for \(r\)-hued coloring of graphs
• Dynamic list coloring of 1-planar graphs

This page was built for publication: Dynamic proper colorings of a graph

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