{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:14:53Z","timestamp":1781014493390,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642214929","type":"print"},{"value":"9783642214936","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_10","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T08:42:44Z","timestamp":1308559364000},"page":"158-173","source":"Crossref","is-referenced-by-count":1,"title":["$\\mathbb F$ -Rank-Width of (Edge-Colored) Graphs"],"prefix":"10.1007","author":[{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Rao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0608028","volume":"8","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Digraph Decompositions and Eulerian Systems. SIAM Journal on Algebraic and Discrete Methods\u00a08(3), 323\u2013337 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ic.2005.11.006","volume":"204","author":"A. Blumensath","year":"2006","unstructured":"Blumensath, A., Courcelle, B.: Recognizability, Hypergraph Operations and Logical Types. Information and Computation\u00a0204(6), 853\u2013919 (2006)","journal-title":"Information and Computation"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: On the Model-Checking of Monadic Second-Order Formulas with Edge Set Quantifications. Discrete Applied Mathematics doi:10.1016\/j.dam.2010.12.017 (in press)","DOI":"10.1016\/j.dam.2010.12.017"},{"key":"10_CR4","unstructured":"Courcelle, B.: Graph Structure and Monadic Second-Order Logic. Book in preparation. Cambridge University Press, Cambridge"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.dam.2008.08.026","volume":"157","author":"B. Courcelle","year":"2009","unstructured":"Courcelle, B., Kant\u00e9, M.M.: Graph Operations Characterizing Rank-Width. Discrete Applied Mathematics\u00a0157(4), 627\u2013640 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1017\/S0960129501003565","volume":"12","author":"B. Courcelle","year":"2002","unstructured":"Courcelle, B., Makowsky, J.A.: Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. Mathematical Structures in Computer Science\u00a012, 203\u2013235 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1-3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper Bounds to the Clique-Width of Graphs. Discrete Applied Mathematics\u00a0101(1-3), 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","volume":"97","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., Oum, S.: Vertex-Minors, Monadic Second-Order Logic and a Conjecture by Seese. Journal of Combinatorial Theory, Series B\u00a097(1), 91\u2013126 (2007)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of Directed Graphs. SIAM Journal on Algebraic and Discrete Methods\u00a03(2), 214\u2013228 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"10_CR10","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/4197","volume-title":"The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs","author":"A. Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.dam.2006.06.020","volume":"156","author":"E. Fisher","year":"2008","unstructured":"Fisher, E., Makowsky, J.A., Ravve, E.V.: Counting Truth Assignments of Formulas of Bounded Tree-Width or Clique-Width. Discrete Applied Mathematics\u00a0156(4), 511\u2013529 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s00224-009-9241-3","volume":"46","author":"U. Flarup","year":"2010","unstructured":"Flarup, U., Lyaudet, L.: On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Path-Width\/Clique-Width. Theory of Computing Systems\u00a046(4), 761\u2013791 (2010)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0095-8956(02)00046-1","volume":"88","author":"J.F. Geelen","year":"2003","unstructured":"Geelen, J.F., Gerards, A.M.H., Robertson, N., Whittle, G.P.: On the Excluded Minors for the Matroids of Branch-Width k. Journal of Combinatorial Theory, Series B\u00a088(2), 261\u2013265 (2003)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding Branch-Decompositions and Rank-Decompositions. SIAM Journal on Computing\u00a038(3), 1012\u20131032 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"12","key":"10_CR16","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M. Kaminski","year":"2009","unstructured":"Kaminski, M., Lozin, V., Milanic, M.: Recent Developments on Graphs of Bounded Clique-Width. Discrete Applied Mathematics\u00a0157(12), 2747\u20132761 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR17","unstructured":"Kan\u00e9, M.M.: Well-Quasi-Ordering of Matrices under Principal Pivot Transforms Revisited, arxiv:1102.2134 (2011) (submitted)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-11409-0_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.M. Kant\u00e9","year":"2010","unstructured":"Kant\u00e9, M.M., Rao, M.: Directed Rank-Width and Displit Decomposition. In: Habib, M., Paul, C. (eds.) WG 2009. LNCS, vol.\u00a05911, pp. 214\u2013225. Springer, Heidelberg (2010)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, 2nd edn (1997)","DOI":"10.1017\/CBO9780511525926"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S. Oum","year":"2005","unstructured":"Oum, S.: Rank-Width and Vertex-Minors. Journal of Combinatorial Theory, Series B\u00a095(1), 79\u2013100 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating Clique-Width and Branch-Width. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors V:Excluding a Planar Graph. Journal of Combinatorial Theory, Series B\u00a041, 92\u2013114 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10_CR23","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency, vol.\u00a0B. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T22:03:47Z","timestamp":1560290627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}