Vertex-minors, monadic second-order logic, and a conjecture by Seese

Cited 43 time in webofscience Cited 0 time in scopus
  • Hit : 262
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCourcelle, Bko
dc.contributor.authorOum, Sang-ilko
dc.date.accessioned2013-03-07T15:59:07Z-
dc.date.available2013-03-07T15:59:07Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2007-01-
dc.identifier.citationJOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.1, pp.91 - 126-
dc.identifier.issn0095-8956-
dc.identifier.urihttp://hdl.handle.net/10203/90616-
dc.description.abstractWe prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a predicate expressing that a set has even cardinality. We obtain a slight weakening of a conjecture by Seese stating that sets of graphs having a decidable satisfiability problem for monadic second-order logic have bounded clique-width. We also obtain a polynomial-time algorithm to check that the rank-width of a graph is at most k for any fixed k. The proofs use isotropic systems. (c) 2006 Elsevier Inc. All rights reserved.-
dc.languageEnglish-
dc.publisherACADEMIC PRESS INC ELSEVIER SCIENCE-
dc.subjectGRAPH MINORS-
dc.subjectCLIQUE-WIDTH-
dc.subjectBRANCH-WIDTH-
dc.subjectISOTROPIC SYSTEMS-
dc.subjectRANK-WIDTH-
dc.subjectTREE-WIDTH-
dc.subjectMATROIDS-
dc.subjectSETS-
dc.subjectOBSTRUCTIONS-
dc.subjectRECOGNITION-
dc.titleVertex-minors, monadic second-order logic, and a conjecture by Seese-
dc.typeArticle-
dc.identifier.wosid000243239700006-
dc.identifier.scopusid2-s2.0-33751429952-
dc.type.rimsART-
dc.citation.volume97-
dc.citation.issue1-
dc.citation.beginningpage91-
dc.citation.endingpage126-
dc.citation.publicationnameJOURNAL OF COMBINATORIAL THEORY SERIES B-
dc.identifier.doi10.1016/j.jctb.2006.04.003-
dc.contributor.localauthorOum, Sang-il-
dc.contributor.nonIdAuthorCourcelle, B-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorclique-width-
dc.subject.keywordAuthorrank-width-
dc.subject.keywordAuthormonadic second-order logic-
dc.subject.keywordAuthorSeese&apos-
dc.subject.keywordAuthors conjecture-
dc.subject.keywordAuthorlocal complementation-
dc.subject.keywordAuthorvertex-minor-
dc.subject.keywordAuthorisotropic system-
dc.subject.keywordPlusGRAPH MINORS-
dc.subject.keywordPlusCLIQUE-WIDTH-
dc.subject.keywordPlusBRANCH-WIDTH-
dc.subject.keywordPlusISOTROPIC SYSTEMS-
dc.subject.keywordPlusRANK-WIDTH-
dc.subject.keywordPlusTREE-WIDTH-
dc.subject.keywordPlusMATROIDS-
dc.subject.keywordPlusSETS-
dc.subject.keywordPlusOBSTRUCTIONS-
dc.subject.keywordPlusRECOGNITION-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 43 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0