On the Number of Maximal Bipartite Subgraphs of a Graph
DOI:
https://doi.org/10.7146/brics.v9i17.21735Resumé
We show new lower and upper bounds on the number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105^{n/10} ~= 1.5926^n such subgraphs, which improves an earlier lower bound by Schiermeyer (1996). We show an upper bound of n . 12^{n/4} ~= n . 1.8613^n and give an algorithm that lists all maximal induced bipartite subgraphs in time proportional to this bound. This is used in an algorithm for checking 4-colourability of a graph running within the same time bound.Downloads
Publiceret
2002-04-05
Citation/Eksport
Madsen, B. A., Byskov, J. M., & Skjernaa, B. (2002). On the Number of Maximal Bipartite Subgraphs of a Graph. BRICS Report Series, 9(17). https://doi.org/10.7146/brics.v9i17.21735
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).