Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/Hasunuma21
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/Hasunuma21
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Toru_Hasunuma
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-021-00833-8
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-021-00833-8
>
dc:
identifier
DBLP journals/algorithmica/Hasunuma21
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-021-00833-8
(xsd:string)
dcterms:
issued
2021
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Toru_Hasunuma
>
swrc:
number
9
(xsd:string)
swrc:
pages
2697-2718
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/Hasunuma21/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/Hasunuma21
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#Hasunuma21
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-021-00833-8
>
dc:
title
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
83
(xsd:string)