Linear time recognition of bipartite star123-free graphs
Author
Source
The International Arab Journal of Information Technology
Issue
Vol. 3, Issue 3 (31 Jul. 2006), pp.193-202, 10 p.
Publisher
Publication Date
2006-07-31
Country of Publication
Jordan
No. of Pages
10
Main Subjects
Information Technology and Computer Science
Topics
Abstract EN
In this paper, we present a linear time recognition algorithm for recognizing bipartite graphs without induced sub graphs isomorphs’ to star123.
Bipartite star123-free graphs are a natural generalization of both weak bisplit and Star123, Sun4- free bipartite graphs, both further generalizing bicographs.
American Psychological Association (APA)
Quaddoura, Ruzayn. 2006. Linear time recognition of bipartite star123-free graphs. The International Arab Journal of Information Technology،Vol. 3, no. 3, pp.193-202.
https://search.emarefa.net/detail/BIM-11822
Modern Language Association (MLA)
Quaddoura, Ruzayn. Linear time recognition of bipartite star123-free graphs. The International Arab Journal of Information Technology Vol. 3, no. 3 (Jul. 2006), pp.193-202.
https://search.emarefa.net/detail/BIM-11822
American Medical Association (AMA)
Quaddoura, Ruzayn. Linear time recognition of bipartite star123-free graphs. The International Arab Journal of Information Technology. 2006. Vol. 3, no. 3, pp.193-202.
https://search.emarefa.net/detail/BIM-11822
Data Type
Journal Articles
Language
English
Notes
includes bibliographical references : p. 202
Record ID
BIM-11822
