scientific article; zbMATH DE number 2147949

zbMath1061.05041MaRDI QIDQ4659607

Manouchehr Zaker

Publication date: 21 March 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bipartite graphsNP-complete problemtotal graphsGrundy chromatic number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (19)

First-fit colorings of graphs with no cycles of a prescribed even length ⋮ Results on the Grundy chromatic number of graphs ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ More results on the \(z\)-chromatic number of graphs ⋮ A new vertex coloring heuristic and corresponding chromatic number ⋮ Unnamed Item ⋮ Grundy number of corona product of some graphs ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ Grundy Coloring and friends, half-graphs, bicliques ⋮ Minimum order of graphs with given coloring parameters ⋮ Inequalities for the Grundy chromatic number of graphs ⋮ More bounds for the Grundy number of graphs ⋮ Complexity of Grundy coloring and its variants ⋮ New potential functions for greedy independence and coloring ⋮ On the Grundy number of graphs with few \(P_4\)'s ⋮ A note on the Grundy number and graph products ⋮ Grundy number on -classes ⋮ Restricted coloring problems on graphs with few ⋮ Transitivity on subclasses of bipartite graphs

This page was built for publication: