Abstract
This chapter targets to determine a decomposition of G into bipartite graphs. In a bipartite graph, the vertex set is partitioned into two independent sets. So, for a bipartite decomposition, we required independent sets. We have partitioned a given graph G into independent sets. A decomposition for G into bipartite graphs is later determined using the possible subsets of cardinality two. This process of determining the decomposition also enable us to determine all possible independent sets and hence a chromatic partition for G. Hence, a proposed algorithm can also be used for determining the chromatic number of G.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Deo, N.: Graph theory with applications to computer science. PHI Learning Private Limited (2013)
Markstrom, K.: Even cycle decompositions of 4-regular graphs and line graphs. Discret. Math. 312(17), 2676–2681 (2012)
Oleg, V.B., Ivanova, A.O., Kostochka, A.V., Sheikh, N.N.: Planar graphs decomposable into a forest and a matching. Discret. Math. 309, 277–279 (2009)
Milici, S., Tuza, Z.: Uniformly resolvable decompositions of Kv into P3 and K3 graphs. Discret. Math. 331, 137–141 (2014)
Gioan, E.: Christophe Paul: Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. Discret. Appl. Math. 160, 708–733 (2012)
Boode, A.H.: Hajo Broersma: Decompositions of graphs based on a new graph product. Discret. Appl. Math. 259, 31–40 (2019)
Rubalcaba, R.R., Schneider, A., Slater, P.J.: A survey on graphs which have equal domination and closed neighborhood packing numbers. AKCE J. Graphs Combin. 3(2), 93–114 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Yamuna, M., Karthika, K. (2024). Bipartite Decomposition of Graphs Using Chromatic Number. In: Kamalov, F., Sivaraj, R., Leung, HH. (eds) Advances in Mathematical Modeling and Scientific Computing. ICRDM 2022. Trends in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-41420-6_64
Download citation
DOI: https://doi.org/10.1007/978-3-031-41420-6_64
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-41419-0
Online ISBN: 978-3-031-41420-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)