The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/BlaserC11
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/mfcs/BlaserC11
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Markus_Bl%E2%88%9A%C2%A7ser
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Radu_Curticapean
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-22993-0%5F12
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-22993-0_12
>
dc:
identifier
DBLP conf/mfcs/BlaserC11
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-22993-0%5F12
(xsd:string)
dcterms:
issued
2011
(xsd:gYear)
rdfs:
label
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Markus_Bl%E2%88%9A%C2%A7ser
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Radu_Curticapean
>
swrc:
pages
96-107
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/2011
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/mfcs/BlaserC11/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/mfcs/BlaserC11
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/mfcs/mfcs2011.html#BlaserC11
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-22993-0_12
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/mfcs
>
dc:
title
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document