On partial Grundy coloring of bipartite graphs and chordal graphs
From MaRDI portal
(Redirected from Publication:2009016)
Recommendations
- Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
- Grundy coloring in some subclasses of bipartite graphs and their complements
- An algorithm for partial Grundy number on trees
- scientific article; zbMATH DE number 2147949
- On the Grundy and \(b\)-chromatic numbers of a graph
Cites work
- A review of tree convex sets test
- Algorithms and Computation
- An algorithm for partial Grundy number on trees
- Dually Chordal Graphs
- Incidence matrices and interval graphs
- Interpolation theorem for partial Grundy coloring
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Some perfect coloring properties of graphs
- Some simplified NP-complete graph problems
Cited in
(7)- An algorithm for partial Grundy number on trees
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- scientific article; zbMATH DE number 2147949 (Why is no real title available?)
- Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
- Interpolation theorem for partial Grundy coloring
- Grundy coloring in some subclasses of bipartite graphs and their complements
- \(b\)-continuity and partial Grundy coloring of graphs with large girth
This page was built for publication: On partial Grundy coloring of bipartite graphs and chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009016)