[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/ol/Malyshev21>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Dmitriy_S._Malyshev>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs11590-020-01679-9>
foaf:homepage <https://doi.org/10.1007/s11590-020-01679-9>
dc:identifier DBLP journals/ol/Malyshev21 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs11590-020-01679-9 (xsd:string)
dcterms:issued 2021 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/ol>
rdfs:label The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Dmitriy_S._Malyshev>
swrc:number 2 (xsd:string)
swrc:pages 311-326 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/ol/Malyshev21/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/ol/Malyshev21>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/ol/ol15.html#Malyshev21>
rdfs:seeAlso <https://doi.org/10.1007/s11590-020-01679-9>
dc:title The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 15 (xsd:string)