Recognizing near-bipartite Pfaffian graphs in polynomial time

Miranda‚ A.A.A.; Lucchesi‚ C.L.

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Google Scholar through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Recognizing near-bipartite Pfaffian graphs in polynomial time

Full text
Author(s):	Miranda‚ A.A.A. ; Lucchesi‚ C.L. Total Authors: 2
Document type:	Journal article
Source:	DISCRETE APPLIED MATHEMATICS; v. 158, n. 12, p. 1275-1278, 2010.

FAPESP's process:	05/04426-6 - Pfaffian graphs and related problems
Grantee:	Alberto Alexandre Assis Miranda
Support Opportunities:	Scholarships in Brazil - Doctorate

Short URL