Dynamic chromatic number of bipartite graphs

DOI10.7561/SACS.2016.2.249MaRDI QIDQ4621208zbMATH OpenFDO

Authors Sasan Saqaeeyan, Esmaiel Mollaahamdi

Publication date 8 February 2019

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

Full work available at URL https://doi.org/10.7561/SACS.2016.2.249

zbMATH Keywords

bipartite graphchromatic numbercomputational complexitydynamic chromatic number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5901911
• 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

Cited in

(6)

• A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
• Dynamic list coloring of 1-planar graphs
• scientific article; zbMATH DE number 5901911 (Why is no real title available?)
• Dynamic coloring on restricted graph classes
• Dynamic list coloring of bipartite graphs
• Dynamic coloring on restricted graph classes

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)