Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computer Science Logic

From MaRDI portal
Publication:5394586
Jump to:navigation, search

DOI10.1007/11538363zbMath1136.68452OpenAlexW2479351976MaRDI QIDQ5394586

Christian Delhommé, Bruno Courcelle

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items

The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ Graph decompositions definable in monadic second-order logic



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5394586&oldid=20120437"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 9 February 2024, at 02:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki