Dynamic chromatic number of bipartite graphs

DOI10.7561/SACS.2016.2.249zbMATH Open1424.05103MaRDI QIDQ4621208FDOQ4621208

Sasan Saqaeeyan, Esmaiel Mollaahamdi

Publication date: 8 February 2019

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Recommendations

• scientific article
• Dynamic list coloring of bipartite graphs
• Dynamic chromatic number of regular graphs
• scientific article; zbMATH DE number 2197944
• On \(r\)-dynamic chromatic number of graphs

zbMATH Keywords

computational complexitybipartite graphchromatic numberdynamic chromatic number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Title not available (Why is that?)
• Dynamic list coloring of bipartite graphs
• Dynamic coloring on restricted graph classes
• Dynamic list coloring of 1-planar graphs

This page was built for publication: Dynamic chromatic number of bipartite graphs

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