Lozin, Vadim V. and Volz, Jordan (2008) The clique-width of bipartite graphs in monogenic classes. In: 4th International Conference on Concept Lattices and Their Applications, Hammamet, Tunsia, Oct 30-Nov 01, 2006. Published in: International Journal of Foundations of Computer Science, Vol.19 (No.2). pp. 477-494.

Full text not available from this repository.

Abstract

In this paper, we provide complete classification of classes of bipartite graphs defined by a single forbidden induced bipartite subgraph with respect to bounded/unbounded clique-width.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Mathematics
Journal or Publication Title:	International Journal of Foundations of Computer Science
Publisher:	World Scientific Publishing Co. Pte. Ltd.
ISSN:	0129-0541
Date:	April 2008
Volume:	Vol.19
Number:	No.2
Number of Pages:	18
Page Range:	pp. 477-494
Identification Number:	10.1142/S0129054108005772
Status:	Peer Reviewed
Publication Status:	Published
Title of Event:	4th International Conference on Concept Lattices and Their Applications
Type of Event:	Conference
Location of Event:	Hammamet, Tunsia
Date(s) of Event:	Oct 30-Nov 01, 2006
URI:	http://wrap.warwick.ac.uk/id/eprint/30115

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item