Ontology type: schema:ScholarlyArticle
2019-03
AUTHORSShipeng Wang, Shoichi Tsuchiya, Liming Xiong
ABSTRACTLet H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. In this paper, we characterize all pairs R, S such that every connected {R,S}-free graph has the same (vertex)-connectivity and edge-connectivity.
PAGES419-426
http://scigraph.springernature.com/pub.10.1007/s00373-018-2003-8
DOIhttp://dx.doi.org/10.1007/s00373-018-2003-8
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1111057363
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"author": [
{
"affiliation": {
"alternateName": "Beijing Institute of Technology",
"id": "https://www.grid.ac/institutes/grid.43555.32",
"name": [
"School of Mathematics and Statistics, Beijing Institute of Technology, 100081, Beijing, People\u2019s Republic of China"
],
"type": "Organization"
},
"familyName": "Wang",
"givenName": "Shipeng",
"id": "sg:person.011571261545.39",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011571261545.39"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Senshu University",
"id": "https://www.grid.ac/institutes/grid.440933.9",
"name": [
"School of Network and Information, Senshu University, 2-1-1 Higashimita, Tama-ku, 214-8580, Kawasaki, Kanagawa, Japan"
],
"type": "Organization"
},
"familyName": "Tsuchiya",
"givenName": "Shoichi",
"id": "sg:person.010177036357.12",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010177036357.12"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Beijing Institute of Technology",
"id": "https://www.grid.ac/institutes/grid.43555.32",
"name": [
"School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, 100081, Beijing, People\u2019s Republic of China"
],
"type": "Organization"
},
"familyName": "Xiong",
"givenName": "Liming",
"id": "sg:person.013510165261.33",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013510165261.33"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1016/s0012-365x(96)00147-1",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1025746856"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.jctb.2005.08.002",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1042659527"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.disc.2015.06.018",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1047225934"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.disc.2017.10.033",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1092916374"
],
"type": "CreativeWork"
},
{
"id": "https://app.dimensions.ai/details/publication/pub.1109706182",
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-1-84628-970-5",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1109706182",
"https://doi.org/10.1007/978-1-84628-970-5"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-1-84628-970-5",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1109706182",
"https://doi.org/10.1007/978-1-84628-970-5"
],
"type": "CreativeWork"
}
],
"datePublished": "2019-03",
"datePublishedReg": "2019-03-01",
"description": "Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. In this paper, we characterize all pairs R, S such that every connected {R,S}-free graph has the same (vertex)-connectivity and edge-connectivity.",
"genre": "research_article",
"id": "sg:pub.10.1007/s00373-018-2003-8",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isFundedItemOf": [
{
"id": "sg:grant.5918178",
"type": "MonetaryGrant"
},
{
"id": "sg:grant.5763872",
"type": "MonetaryGrant"
}
],
"isPartOf": [
{
"id": "sg:journal.1136071",
"issn": [
"0911-0119",
"1435-5914"
],
"name": "Graphs and Combinatorics",
"type": "Periodical"
},
{
"issueNumber": "2",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "35"
}
],
"name": "Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs",
"pagination": "419-426",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"2247ea379431009d1a5fcb6dd221ff3a102ed2be75b5160d61c62ba93f294319"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s00373-018-2003-8"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1111057363"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s00373-018-2003-8",
"https://app.dimensions.ai/details/publication/pub.1111057363"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-11T09:09",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000338_0000000338/records_47966_00000002.jsonl",
"type": "ScholarlyArticle",
"url": "https://link.springer.com/10.1007%2Fs00373-018-2003-8"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-2003-8'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-2003-8'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-2003-8'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00373-018-2003-8'
This table displays all metadata directly associated to this object as RDF triples.
93 TRIPLES
20 PREDICATES
31 URIs
19 LITERALS
7 BLANK NODES