Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2019-03

AUTHORS

Shipeng Wang, Shoichi Tsuchiya, Liming Xiong

ABSTRACT

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.

PAGES

419-426

References to SciGraph publications

  • 2008. Graph Theory in NONE
  • Journal

    TITLE

    Graphs and Combinatorics

    ISSUE

    2

    VOLUME

    35

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00373-018-2003-8

    DOI

    http://dx.doi.org/10.1007/s00373-018-2003-8

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1111057363


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    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

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    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

    Subject Predicate Object
    1 sg:pub.10.1007/s00373-018-2003-8 schema:author Nb3ca7c487cf946ada19e0a93515dc6f4
    2 schema:citation sg:pub.10.1007/978-1-84628-970-5
    3 https://app.dimensions.ai/details/publication/pub.1109706182
    4 https://doi.org/10.1016/j.disc.2015.06.018
    5 https://doi.org/10.1016/j.disc.2017.10.033
    6 https://doi.org/10.1016/j.jctb.2005.08.002
    7 https://doi.org/10.1016/s0012-365x(96)00147-1
    8 schema:datePublished 2019-03
    9 schema:datePublishedReg 2019-03-01
    10 schema: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.
    11 schema:genre research_article
    12 schema:inLanguage en
    13 schema:isAccessibleForFree false
    14 schema:isPartOf N5451d243a3a943ec9fc7d8b7d4191ee4
    15 Ne2b10a59ef314c56a2a77772779b891f
    16 sg:journal.1136071
    17 schema:name Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs
    18 schema:pagination 419-426
    19 schema:productId N28266d203bb4489f93dc039b28d395ba
    20 N5b976bca6acb41f4a3e999392ebcd5c0
    21 N81abcc3a59fe4d73bb49c9bd1aa1ab97
    22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1111057363
    23 https://doi.org/10.1007/s00373-018-2003-8
    24 schema:sdDatePublished 2019-04-11T09:09
    25 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    26 schema:sdPublisher N871c8ce247854169a4c92be61e52c166
    27 schema:url https://link.springer.com/10.1007%2Fs00373-018-2003-8
    28 sgo:license sg:explorer/license/
    29 sgo:sdDataset articles
    30 rdf:type schema:ScholarlyArticle
    31 N115e489034984ca79ee087483e3ad3a8 rdf:first sg:person.013510165261.33
    32 rdf:rest rdf:nil
    33 N28266d203bb4489f93dc039b28d395ba schema:name dimensions_id
    34 schema:value pub.1111057363
    35 rdf:type schema:PropertyValue
    36 N5451d243a3a943ec9fc7d8b7d4191ee4 schema:volumeNumber 35
    37 rdf:type schema:PublicationVolume
    38 N5b976bca6acb41f4a3e999392ebcd5c0 schema:name doi
    39 schema:value 10.1007/s00373-018-2003-8
    40 rdf:type schema:PropertyValue
    41 N81abcc3a59fe4d73bb49c9bd1aa1ab97 schema:name readcube_id
    42 schema:value 2247ea379431009d1a5fcb6dd221ff3a102ed2be75b5160d61c62ba93f294319
    43 rdf:type schema:PropertyValue
    44 N871c8ce247854169a4c92be61e52c166 schema:name Springer Nature - SN SciGraph project
    45 rdf:type schema:Organization
    46 Nb3ca7c487cf946ada19e0a93515dc6f4 rdf:first sg:person.011571261545.39
    47 rdf:rest Nf11571fc963c44ac8948fded576f4860
    48 Ne2b10a59ef314c56a2a77772779b891f schema:issueNumber 2
    49 rdf:type schema:PublicationIssue
    50 Nf11571fc963c44ac8948fded576f4860 rdf:first sg:person.010177036357.12
    51 rdf:rest N115e489034984ca79ee087483e3ad3a8
    52 sg:grant.5763872 http://pending.schema.org/fundedItem sg:pub.10.1007/s00373-018-2003-8
    53 rdf:type schema:MonetaryGrant
    54 sg:grant.5918178 http://pending.schema.org/fundedItem sg:pub.10.1007/s00373-018-2003-8
    55 rdf:type schema:MonetaryGrant
    56 sg:journal.1136071 schema:issn 0911-0119
    57 1435-5914
    58 schema:name Graphs and Combinatorics
    59 rdf:type schema:Periodical
    60 sg:person.010177036357.12 schema:affiliation https://www.grid.ac/institutes/grid.440933.9
    61 schema:familyName Tsuchiya
    62 schema:givenName Shoichi
    63 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010177036357.12
    64 rdf:type schema:Person
    65 sg:person.011571261545.39 schema:affiliation https://www.grid.ac/institutes/grid.43555.32
    66 schema:familyName Wang
    67 schema:givenName Shipeng
    68 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011571261545.39
    69 rdf:type schema:Person
    70 sg:person.013510165261.33 schema:affiliation https://www.grid.ac/institutes/grid.43555.32
    71 schema:familyName Xiong
    72 schema:givenName Liming
    73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013510165261.33
    74 rdf:type schema:Person
    75 sg:pub.10.1007/978-1-84628-970-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109706182
    76 https://doi.org/10.1007/978-1-84628-970-5
    77 rdf:type schema:CreativeWork
    78 https://app.dimensions.ai/details/publication/pub.1109706182 schema:CreativeWork
    79 https://doi.org/10.1016/j.disc.2015.06.018 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047225934
    80 rdf:type schema:CreativeWork
    81 https://doi.org/10.1016/j.disc.2017.10.033 schema:sameAs https://app.dimensions.ai/details/publication/pub.1092916374
    82 rdf:type schema:CreativeWork
    83 https://doi.org/10.1016/j.jctb.2005.08.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042659527
    84 rdf:type schema:CreativeWork
    85 https://doi.org/10.1016/s0012-365x(96)00147-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025746856
    86 rdf:type schema:CreativeWork
    87 https://www.grid.ac/institutes/grid.43555.32 schema:alternateName Beijing Institute of Technology
    88 schema:name School of Mathematics and Statistics, Beijing Institute of Technology, 100081, Beijing, People’s Republic of China
    89 School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, 100081, Beijing, People’s Republic of China
    90 rdf:type schema:Organization
    91 https://www.grid.ac/institutes/grid.440933.9 schema:alternateName Senshu University
    92 schema:name School of Network and Information, Senshu University, 2-1-1 Higashimita, Tama-ku, 214-8580, Kawasaki, Kanagawa, Japan
    93 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...