Abstract
A proper k-coloring of \(G=(V,E)\) is an assignment of k colors to vertices of G such that no two adjacent vertices receive the same color. A proper k-coloring of a graph \(G = (V,E)\) partitions V into independent sets or color classes \(V_1,V_2,\ldots ,V_k\). A vertex \(v \in V_i\) is a Grundy vertex if it is adjacent to at least one vertex in each color class \(V_j\) for every \(j < i\). A coloring is a partial Grundy coloring if every color class has at least one Grundy vertex in it and the partial Grundy number, \(\delta \varGamma (G)\) of a graph G is the maximum number of colors used in a partial Grundy coloring. Given a graph G and an integer \(k (1 \le k \le n)\), the Partial Grundy Number Decision problem is to decide whether \(\delta \varGamma (G) \ge k\). It is known that the Partial Grundy Number Decision problem is NP-complete for bipartite graphs. In this paper, we strengthen this result by proving that this problem remains NP-complete even for perfect elimination bipartite graphs, a proper subclass of bipartite graphs. On the positive side, we propose a linear time algorithm to determine the partial Grundy number of a chain graph, a proper subclass of perfect elimination bipartite graphs. It is also known that the Partial Grundy Number Decision problem is NP-complete for (disconnected) chordal graphs. We strengthen this result by proving that the Partial Grundy Number Decision problem remains NP-complete even for (connected) doubly chordal graphs, a proper subclass of chordal graphs. On the positive side, we propose a linear time algorithm to determine the partial Grundy number of split graphs, a well known subclass of chordal graphs.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Balakrishnan, R., Kavaskar, T.: Interpolation theorem for partial Grundy coloring. Discrete Math. 313(8), 949–950 (2013)
Brandstädt, A., Dragan, F.F., Chepoi, V., Voloshin, V.I.: Dually chordal graphs. SIAM J. Discrete Math. 11, 437–455 (1998)
Christen, C.A., Selkow, S.M.: Some perfect coloring properties of graphs. J. Combin. Theory Ser. B. 27, 49–59 (1979)
Effantin, B., Gastineau, N., Togni, O.: A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Maths. arXiv:1505.07780v2 [cs.DM] (2016)
Erdös, P., Hedetniemi, S.T., Laskar, R.C., Prins, G.C.E.: On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discrete Math. 272(1), 53–64 (2003)
Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math. 15, 835–855 (1965)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237–267 (1976)
Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory. 2, 155–163 (1978)
Shi, Z., Goddard, W., Hedetniemi, S.T., Kennedy, K., Laskar, R., McRae, A.: An algorithm for partial Grundy number on trees. Discrete Math. 304, 108–116 (2005)
Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 871–883. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30551-4_74
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Panda, B.S., Verma, S. (2017). Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-64419-6_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64418-9
Online ISBN: 978-3-319-64419-6
eBook Packages: Computer ScienceComputer Science (R0)